/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:20:24,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:20:24,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:20:24,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:20:24,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:20:24,297 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:20:24,302 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:20:24,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:20:24,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:20:24,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:20:24,326 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:20:24,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:20:24,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:20:24,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:20:24,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:20:24,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:20:24,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:20:24,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:20:24,353 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:20:24,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:20:24,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:20:24,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:20:24,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:20:24,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:20:24,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:20:24,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:20:24,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:20:24,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:20:24,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:20:24,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:20:24,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:20:24,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:20:24,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:20:24,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:20:24,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:20:24,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:20:24,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:20:24,388 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:20:24,388 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:20:24,389 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:20:24,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:20:24,391 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2021-01-07 05:20:24,433 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:20:24,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:20:24,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:20:24,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:20:24,435 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:20:24,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:20:24,436 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:20:24,436 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:20:24,436 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:20:24,437 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:20:24,437 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:20:24,437 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:20:24,437 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:20:24,437 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:20:24,438 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:20:24,438 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:20:24,438 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:20:24,438 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:20:24,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:20:24,439 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:20:24,439 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:20:24,439 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:20:24,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:20:24,440 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:20:24,440 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-bitabs/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 [2021-01-07 05:20:24,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:20:24,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:20:24,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:20:24,924 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:20:24,925 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:20:24,926 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2021-01-07 05:20:25,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/43e430726/4b72e107cf424606bdb482852f9ce12b/FLAGec2c53d1e [2021-01-07 05:20:25,778 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:20:25,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2021-01-07 05:20:25,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/43e430726/4b72e107cf424606bdb482852f9ce12b/FLAGec2c53d1e [2021-01-07 05:20:26,019 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/43e430726/4b72e107cf424606bdb482852f9ce12b [2021-01-07 05:20:26,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:20:26,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:20:26,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:20:26,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:20:26,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:20:26,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c091f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26, skipping insertion in model container [2021-01-07 05:20:26,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:20:26,113 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],StructAccessExpression[IdentifierExpression[~item~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~item~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~plist,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] left hand side expression in assignment: lhs: VariableLHS[~list~0,] [2021-01-07 05:20:26,493 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:20:26,514 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],StructAccessExpression[IdentifierExpression[~item~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~item~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~item~0,],offset]]]] left hand side expression in assignment: address: IdentifierExpression[~plist,] left hand side expression in assignment: address: IdentifierExpression[~#list~0,] left hand side expression in assignment: address: IdentifierExpression[~#list~0,] [2021-01-07 05:20:26,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:20:26,658 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:20:26,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26 WrapperNode [2021-01-07 05:20:26,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:20:26,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:20:26,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:20:26,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:20:26,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:20:26,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:20:26,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:20:26,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:20:26,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... [2021-01-07 05:20:26,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:20:26,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:20:26,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:20:26,832 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:20:26,836 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:20:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:20:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:20:26,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:20:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:20:26,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:20:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-01-07 05:20:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:20:26,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:20:26,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:20:27,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:20:27,534 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-01-07 05:20:27,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:27 BoogieIcfgContainer [2021-01-07 05:20:27,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:20:27,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:20:27,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:20:27,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:20:27,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:20:26" (1/3) ... [2021-01-07 05:20:27,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242aeb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:20:27, skipping insertion in model container [2021-01-07 05:20:27,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:20:26" (2/3) ... [2021-01-07 05:20:27,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242aeb12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:20:27, skipping insertion in model container [2021-01-07 05:20:27,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:20:27" (3/3) ... [2021-01-07 05:20:27,545 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2021-01-07 05:20:27,552 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:20:27,558 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 44 error locations. [2021-01-07 05:20:27,577 INFO L253 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2021-01-07 05:20:27,598 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:20:27,598 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:20:27,598 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:20:27,598 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:20:27,599 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:20:27,599 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:20:27,599 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:20:27,599 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:20:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states. [2021-01-07 05:20:27,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:20:27,623 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:27,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:20:27,625 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:27,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:27,631 INFO L82 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2021-01-07 05:20:27,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:27,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346012660] [2021-01-07 05:20:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:27,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:27,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346012660] [2021-01-07 05:20:27,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:27,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:27,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273609816] [2021-01-07 05:20:27,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:27,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:27,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:27,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:27,920 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2021-01-07 05:20:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,101 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2021-01-07 05:20:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:28,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2021-01-07 05:20:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,114 INFO L225 Difference]: With dead ends: 101 [2021-01-07 05:20:28,115 INFO L226 Difference]: Without dead ends: 99 [2021-01-07 05:20:28,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:28,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-01-07 05:20:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2021-01-07 05:20:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2021-01-07 05:20:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2021-01-07 05:20:28,162 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 4 [2021-01-07 05:20:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,162 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2021-01-07 05:20:28,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2021-01-07 05:20:28,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-01-07 05:20:28,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-01-07 05:20:28,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:20:28,164 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:28,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2021-01-07 05:20:28,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:28,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108660336] [2021-01-07 05:20:28,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:28,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:28,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108660336] [2021-01-07 05:20:28,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:28,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:28,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669103862] [2021-01-07 05:20:28,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:28,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:28,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:28,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:28,301 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 4 states. [2021-01-07 05:20:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,657 INFO L93 Difference]: Finished difference Result 167 states and 174 transitions. [2021-01-07 05:20:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:28,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2021-01-07 05:20:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,660 INFO L225 Difference]: With dead ends: 167 [2021-01-07 05:20:28,661 INFO L226 Difference]: Without dead ends: 167 [2021-01-07 05:20:28,662 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:28,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-01-07 05:20:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 87. [2021-01-07 05:20:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2021-01-07 05:20:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2021-01-07 05:20:28,673 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 4 [2021-01-07 05:20:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,674 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2021-01-07 05:20:28,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2021-01-07 05:20:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:20:28,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:20:28,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:20:28,676 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2021-01-07 05:20:28,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:28,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653013674] [2021-01-07 05:20:28,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:28,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:28,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653013674] [2021-01-07 05:20:28,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:28,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:28,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938081109] [2021-01-07 05:20:28,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:28,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:28,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:28,720 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand 3 states. [2021-01-07 05:20:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,802 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2021-01-07 05:20:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:20:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,804 INFO L225 Difference]: With dead ends: 93 [2021-01-07 05:20:28,804 INFO L226 Difference]: Without dead ends: 93 [2021-01-07 05:20:28,805 INFO L677 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-01-07 05:20:28,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-01-07 05:20:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2021-01-07 05:20:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 05:20:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2021-01-07 05:20:28,813 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 5 [2021-01-07 05:20:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,813 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2021-01-07 05:20:28,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2021-01-07 05:20:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-01-07 05:20:28,814 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-01-07 05:20:28,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:20:28,815 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:28,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:28,816 INFO L82 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2021-01-07 05:20:28,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:28,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296471259] [2021-01-07 05:20:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:28,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296471259] [2021-01-07 05:20:28,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:28,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:20:28,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681394044] [2021-01-07 05:20:28,864 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:20:28,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:20:28,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:20:28,866 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 3 states. [2021-01-07 05:20:28,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:28,927 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2021-01-07 05:20:28,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:28,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-01-07 05:20:28,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:28,929 INFO L225 Difference]: With dead ends: 80 [2021-01-07 05:20:28,929 INFO L226 Difference]: Without dead ends: 80 [2021-01-07 05:20:28,929 INFO L677 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-01-07 05:20:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-07 05:20:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2021-01-07 05:20:28,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-07 05:20:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2021-01-07 05:20:28,936 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 5 [2021-01-07 05:20:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:28,936 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2021-01-07 05:20:28,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:20:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2021-01-07 05:20:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:20:28,937 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:28,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:28,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:20:28,938 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:28,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:28,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2021-01-07 05:20:28,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:28,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476198694] [2021-01-07 05:20:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476198694] [2021-01-07 05:20:29,038 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:29,038 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:20:29,039 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700650735] [2021-01-07 05:20:29,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:20:29,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:29,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:20:29,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:20:29,040 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 7 states. [2021-01-07 05:20:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:29,260 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2021-01-07 05:20:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-07 05:20:29,260 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2021-01-07 05:20:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:29,261 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:20:29,261 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:20:29,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:20:29,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:20:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2021-01-07 05:20:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:20:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2021-01-07 05:20:29,268 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 10 [2021-01-07 05:20:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:29,269 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2021-01-07 05:20:29,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:20:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2021-01-07 05:20:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-01-07 05:20:29,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:29,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:29,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:20:29,270 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:29,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:29,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2021-01-07 05:20:29,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:29,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573138052] [2021-01-07 05:20:29,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573138052] [2021-01-07 05:20:29,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:29,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:29,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333198826] [2021-01-07 05:20:29,362 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:29,362 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:29,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:29,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:29,363 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 6 states. [2021-01-07 05:20:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:29,498 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2021-01-07 05:20:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:20:29,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2021-01-07 05:20:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:29,499 INFO L225 Difference]: With dead ends: 93 [2021-01-07 05:20:29,500 INFO L226 Difference]: Without dead ends: 93 [2021-01-07 05:20:29,500 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:20:29,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-01-07 05:20:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2021-01-07 05:20:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:20:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2021-01-07 05:20:29,505 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 11 [2021-01-07 05:20:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:29,506 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2021-01-07 05:20:29,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2021-01-07 05:20:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:20:29,507 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:29,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:29,507 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:20:29,507 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1868053176, now seen corresponding path program 1 times [2021-01-07 05:20:29,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:29,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873410803] [2021-01-07 05:20:29,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873410803] [2021-01-07 05:20:29,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:29,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:29,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749798214] [2021-01-07 05:20:29,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:29,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:29,596 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand 6 states. [2021-01-07 05:20:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:29,770 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2021-01-07 05:20:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:29,771 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-07 05:20:29,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:29,773 INFO L225 Difference]: With dead ends: 89 [2021-01-07 05:20:29,773 INFO L226 Difference]: Without dead ends: 89 [2021-01-07 05:20:29,774 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-01-07 05:20:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 80. [2021-01-07 05:20:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-07 05:20:29,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2021-01-07 05:20:29,785 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 17 [2021-01-07 05:20:29,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:29,786 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2021-01-07 05:20:29,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:29,786 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2021-01-07 05:20:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-07 05:20:29,787 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:29,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:29,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:20:29,787 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1868053177, now seen corresponding path program 1 times [2021-01-07 05:20:29,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:29,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226003101] [2021-01-07 05:20:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:29,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:29,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226003101] [2021-01-07 05:20:29,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:29,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:29,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827230610] [2021-01-07 05:20:29,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:29,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:29,921 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2021-01-07 05:20:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:30,093 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2021-01-07 05:20:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:30,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2021-01-07 05:20:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:30,095 INFO L225 Difference]: With dead ends: 91 [2021-01-07 05:20:30,095 INFO L226 Difference]: Without dead ends: 91 [2021-01-07 05:20:30,096 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2021-01-07 05:20:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2021-01-07 05:20:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-07 05:20:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2021-01-07 05:20:30,099 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 17 [2021-01-07 05:20:30,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:30,099 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2021-01-07 05:20:30,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2021-01-07 05:20:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-01-07 05:20:30,100 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:30,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:30,101 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:20:30,101 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:30,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:30,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2076126984, now seen corresponding path program 1 times [2021-01-07 05:20:30,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:30,102 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936607452] [2021-01-07 05:20:30,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:30,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936607452] [2021-01-07 05:20:30,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:30,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:30,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488344229] [2021-01-07 05:20:30,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:30,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:30,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:30,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:30,146 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 4 states. [2021-01-07 05:20:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:30,164 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2021-01-07 05:20:30,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:20:30,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2021-01-07 05:20:30,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:30,165 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:20:30,165 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:20:30,166 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:30,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:20:30,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2021-01-07 05:20:30,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-07 05:20:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2021-01-07 05:20:30,169 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 18 [2021-01-07 05:20:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:30,169 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2021-01-07 05:20:30,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2021-01-07 05:20:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:20:30,170 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:30,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:30,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:20:30,171 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1280939784, now seen corresponding path program 1 times [2021-01-07 05:20:30,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:30,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766038195] [2021-01-07 05:20:30,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:30,334 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766038195] [2021-01-07 05:20:30,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:30,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:20:30,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562505227] [2021-01-07 05:20:30,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:20:30,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:30,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:20:30,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:30,360 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 8 states. [2021-01-07 05:20:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:30,573 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2021-01-07 05:20:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:30,573 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2021-01-07 05:20:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:30,574 INFO L225 Difference]: With dead ends: 73 [2021-01-07 05:20:30,574 INFO L226 Difference]: Without dead ends: 73 [2021-01-07 05:20:30,575 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:20:30,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2021-01-07 05:20:30,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-01-07 05:20:30,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-01-07 05:20:30,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2021-01-07 05:20:30,577 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 20 [2021-01-07 05:20:30,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:30,578 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2021-01-07 05:20:30,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:20:30,578 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2021-01-07 05:20:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-01-07 05:20:30,579 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:30,579 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:30,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-07 05:20:30,580 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1280939783, now seen corresponding path program 1 times [2021-01-07 05:20:30,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:30,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560232576] [2021-01-07 05:20:30,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:30,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:30,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560232576] [2021-01-07 05:20:30,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:30,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:30,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813800958] [2021-01-07 05:20:30,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:30,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:30,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:30,623 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 5 states. [2021-01-07 05:20:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:30,746 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2021-01-07 05:20:30,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:30,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2021-01-07 05:20:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:30,747 INFO L225 Difference]: With dead ends: 72 [2021-01-07 05:20:30,747 INFO L226 Difference]: Without dead ends: 72 [2021-01-07 05:20:30,748 INFO L677 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-01-07 05:20:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2021-01-07 05:20:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2021-01-07 05:20:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-07 05:20:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2021-01-07 05:20:30,750 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 20 [2021-01-07 05:20:30,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:30,751 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-01-07 05:20:30,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2021-01-07 05:20:30,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:20:30,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:30,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:30,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-07 05:20:30,752 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:30,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:30,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1054427643, now seen corresponding path program 1 times [2021-01-07 05:20:30,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:30,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000542670] [2021-01-07 05:20:30,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:30,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:30,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000542670] [2021-01-07 05:20:30,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:30,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:20:30,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932485795] [2021-01-07 05:20:30,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:20:30,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:20:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:30,908 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 10 states. [2021-01-07 05:20:31,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:31,569 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2021-01-07 05:20:31,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:20:31,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2021-01-07 05:20:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:31,575 INFO L225 Difference]: With dead ends: 137 [2021-01-07 05:20:31,575 INFO L226 Difference]: Without dead ends: 137 [2021-01-07 05:20:31,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:20:31,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-01-07 05:20:31,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2021-01-07 05:20:31,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:20:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2021-01-07 05:20:31,585 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 21 [2021-01-07 05:20:31,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:31,585 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2021-01-07 05:20:31,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:20:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2021-01-07 05:20:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:31,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:31,589 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:31,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:20:31,589 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:31,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1672481337, now seen corresponding path program 1 times [2021-01-07 05:20:31,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:31,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809154717] [2021-01-07 05:20:31,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:32,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:32,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809154717] [2021-01-07 05:20:32,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:32,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-01-07 05:20:32,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644793470] [2021-01-07 05:20:32,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-07 05:20:32,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-07 05:20:32,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:20:32,043 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 11 states. [2021-01-07 05:20:33,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:33,179 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2021-01-07 05:20:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:20:33,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2021-01-07 05:20:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:33,181 INFO L225 Difference]: With dead ends: 136 [2021-01-07 05:20:33,181 INFO L226 Difference]: Without dead ends: 136 [2021-01-07 05:20:33,182 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:20:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-01-07 05:20:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 86. [2021-01-07 05:20:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:20:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2021-01-07 05:20:33,187 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 22 [2021-01-07 05:20:33,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:33,187 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2021-01-07 05:20:33,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-07 05:20:33,188 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2021-01-07 05:20:33,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:33,189 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:33,189 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:33,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:20:33,190 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:33,191 INFO L82 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2021-01-07 05:20:33,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:33,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976210394] [2021-01-07 05:20:33,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:33,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976210394] [2021-01-07 05:20:33,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404449746] [2021-01-07 05:20:33,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:33,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 34 conjunts are in the unsatisfiable core [2021-01-07 05:20:33,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:33,514 INFO L382 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-01-07 05:20:33,515 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:33,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:33,528 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:33,528 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-01-07 05:20:33,642 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:33,643 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:20:33,646 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:33,677 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-07 05:20:33,679 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:33,680 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2021-01-07 05:20:33,758 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:33,759 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:33,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:33,779 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:33,779 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:19 [2021-01-07 05:20:33,918 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:33,919 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2021-01-07 05:20:33,921 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:33,949 INFO L625 ElimStorePlain]: treesize reduction 26, result has 48.0 percent of original size [2021-01-07 05:20:33,951 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:33,951 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2021-01-07 05:20:34,058 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:34,089 INFO L348 Elim1Store]: treesize reduction 48, result has 27.3 percent of original size [2021-01-07 05:20:34,090 INFO L382 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 25 treesize of output 30 [2021-01-07 05:20:34,092 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:34,134 INFO L625 ElimStorePlain]: treesize reduction 11, result has 76.1 percent of original size [2021-01-07 05:20:34,142 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:34,143 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:32 [2021-01-07 05:20:34,269 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:34,270 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2021-01-07 05:20:34,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:34,279 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:34,282 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:34,283 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:39, output treesize:11 [2021-01-07 05:20:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:34,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:34,302 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2021-01-07 05:20:34,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046098687] [2021-01-07 05:20:34,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-01-07 05:20:34,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:34,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-01-07 05:20:34,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:20:34,304 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 16 states. [2021-01-07 05:20:35,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:35,300 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2021-01-07 05:20:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:20:35,300 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2021-01-07 05:20:35,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:35,301 INFO L225 Difference]: With dead ends: 102 [2021-01-07 05:20:35,301 INFO L226 Difference]: Without dead ends: 102 [2021-01-07 05:20:35,302 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2021-01-07 05:20:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2021-01-07 05:20:35,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2021-01-07 05:20:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:20:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2021-01-07 05:20:35,304 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 22 [2021-01-07 05:20:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:35,305 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2021-01-07 05:20:35,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-01-07 05:20:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2021-01-07 05:20:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:20:35,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:35,306 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:35,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:20:35,507 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:35,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2021-01-07 05:20:35,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:35,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35567821] [2021-01-07 05:20:35,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:35,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35567821] [2021-01-07 05:20:35,670 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693494580] [2021-01-07 05:20:35,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:35,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:20:35,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:35,805 INFO L382 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-01-07 05:20:35,806 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:35,814 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:35,814 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:35,815 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-01-07 05:20:35,952 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:35,953 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2021-01-07 05:20:35,956 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:35,989 INFO L625 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2021-01-07 05:20:35,990 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:35,991 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2021-01-07 05:20:36,088 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:36,089 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,112 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:36,114 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,131 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,135 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:36,135 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:41 [2021-01-07 05:20:36,222 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,222 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2021-01-07 05:20:36,225 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,260 INFO L625 ElimStorePlain]: treesize reduction 26, result has 59.4 percent of original size [2021-01-07 05:20:36,262 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:36,263 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:38 [2021-01-07 05:20:36,381 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:36,395 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-01-07 05:20:36,396 INFO L382 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 20 [2021-01-07 05:20:36,397 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,421 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,426 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:36,442 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-01-07 05:20:36,442 INFO L382 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 21 [2021-01-07 05:20:36,444 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,468 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,475 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:36,476 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:57 [2021-01-07 05:20:36,615 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,616 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2021-01-07 05:20:36,617 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,634 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,643 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,643 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2021-01-07 05:20:36,645 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:36,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:36,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:36,659 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:71, output treesize:17 [2021-01-07 05:20:36,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:36,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:36,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2021-01-07 05:20:36,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376356452] [2021-01-07 05:20:36,702 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:20:36,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:36,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:20:36,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:20:36,703 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 19 states. [2021-01-07 05:20:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:38,268 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2021-01-07 05:20:38,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:20:38,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2021-01-07 05:20:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:38,269 INFO L225 Difference]: With dead ends: 113 [2021-01-07 05:20:38,269 INFO L226 Difference]: Without dead ends: 113 [2021-01-07 05:20:38,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:20:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-01-07 05:20:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2021-01-07 05:20:38,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:20:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-01-07 05:20:38,273 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 22 [2021-01-07 05:20:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:38,273 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-01-07 05:20:38,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:20:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-01-07 05:20:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:20:38,274 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:38,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:38,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-07 05:20:38,484 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash -307313795, now seen corresponding path program 1 times [2021-01-07 05:20:38,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:38,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138931319] [2021-01-07 05:20:38,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:38,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138931319] [2021-01-07 05:20:38,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:38,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-01-07 05:20:38,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902155023] [2021-01-07 05:20:38,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:20:38,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:20:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:38,714 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 10 states. [2021-01-07 05:20:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:39,339 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2021-01-07 05:20:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-07 05:20:39,340 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2021-01-07 05:20:39,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:39,341 INFO L225 Difference]: With dead ends: 98 [2021-01-07 05:20:39,341 INFO L226 Difference]: Without dead ends: 98 [2021-01-07 05:20:39,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2021-01-07 05:20:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-01-07 05:20:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2021-01-07 05:20:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:20:39,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2021-01-07 05:20:39,344 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 23 [2021-01-07 05:20:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:39,344 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2021-01-07 05:20:39,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:20:39,344 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2021-01-07 05:20:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:20:39,345 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:39,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:39,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:20:39,345 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:39,346 INFO L82 PathProgramCache]: Analyzing trace with hash -936792950, now seen corresponding path program 1 times [2021-01-07 05:20:39,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:39,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176316835] [2021-01-07 05:20:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:39,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176316835] [2021-01-07 05:20:39,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:39,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:20:39,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051660102] [2021-01-07 05:20:39,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:20:39,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:39,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:20:39,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:20:39,439 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 8 states. [2021-01-07 05:20:39,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:39,600 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-01-07 05:20:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:39,603 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2021-01-07 05:20:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:39,604 INFO L225 Difference]: With dead ends: 84 [2021-01-07 05:20:39,604 INFO L226 Difference]: Without dead ends: 84 [2021-01-07 05:20:39,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:20:39,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-07 05:20:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-01-07 05:20:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:20:39,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-01-07 05:20:39,607 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 24 [2021-01-07 05:20:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:39,608 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-01-07 05:20:39,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:20:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-01-07 05:20:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:20:39,608 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:39,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:39,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:20:39,609 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -936792949, now seen corresponding path program 1 times [2021-01-07 05:20:39,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:39,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521648278] [2021-01-07 05:20:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:39,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521648278] [2021-01-07 05:20:39,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:39,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:20:39,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748105230] [2021-01-07 05:20:39,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:20:39,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:39,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:20:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:39,657 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 4 states. [2021-01-07 05:20:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:39,701 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2021-01-07 05:20:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:20:39,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2021-01-07 05:20:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:39,703 INFO L225 Difference]: With dead ends: 79 [2021-01-07 05:20:39,703 INFO L226 Difference]: Without dead ends: 79 [2021-01-07 05:20:39,703 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:20:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-01-07 05:20:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2021-01-07 05:20:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2021-01-07 05:20:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2021-01-07 05:20:39,708 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 24 [2021-01-07 05:20:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:39,708 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2021-01-07 05:20:39,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:20:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2021-01-07 05:20:39,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:20:39,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:39,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:39,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:20:39,710 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1024189665, now seen corresponding path program 1 times [2021-01-07 05:20:39,713 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:39,713 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925096524] [2021-01-07 05:20:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:39,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925096524] [2021-01-07 05:20:39,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:39,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:39,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664093266] [2021-01-07 05:20:39,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:39,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:39,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:39,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:39,798 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand 5 states. [2021-01-07 05:20:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:39,894 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2021-01-07 05:20:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:20:39,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2021-01-07 05:20:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:39,895 INFO L225 Difference]: With dead ends: 78 [2021-01-07 05:20:39,895 INFO L226 Difference]: Without dead ends: 78 [2021-01-07 05:20:39,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-01-07 05:20:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2021-01-07 05:20:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2021-01-07 05:20:39,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2021-01-07 05:20:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2021-01-07 05:20:39,898 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 25 [2021-01-07 05:20:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:39,899 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2021-01-07 05:20:39,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:39,899 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2021-01-07 05:20:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-01-07 05:20:39,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:39,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:39,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:20:39,900 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1685108650, now seen corresponding path program 1 times [2021-01-07 05:20:39,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:39,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662772787] [2021-01-07 05:20:39,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:39,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662772787] [2021-01-07 05:20:39,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:39,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:20:39,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337309513] [2021-01-07 05:20:39,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:39,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:39,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:39,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:39,957 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2021-01-07 05:20:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:40,099 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-01-07 05:20:40,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:40,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2021-01-07 05:20:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:40,100 INFO L225 Difference]: With dead ends: 77 [2021-01-07 05:20:40,100 INFO L226 Difference]: Without dead ends: 77 [2021-01-07 05:20:40,101 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-01-07 05:20:40,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-07 05:20:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-01-07 05:20:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2021-01-07 05:20:40,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2021-01-07 05:20:40,103 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 26 [2021-01-07 05:20:40,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:40,104 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2021-01-07 05:20:40,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2021-01-07 05:20:40,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:20:40,104 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:40,105 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:40,105 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:20:40,105 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:40,105 INFO L82 PathProgramCache]: Analyzing trace with hash 698760707, now seen corresponding path program 1 times [2021-01-07 05:20:40,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:40,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576356106] [2021-01-07 05:20:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:40,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576356106] [2021-01-07 05:20:40,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:40,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-01-07 05:20:40,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854142604] [2021-01-07 05:20:40,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-07 05:20:40,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-07 05:20:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:20:40,367 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 13 states. [2021-01-07 05:20:41,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:41,189 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2021-01-07 05:20:41,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-07 05:20:41,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2021-01-07 05:20:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:41,190 INFO L225 Difference]: With dead ends: 84 [2021-01-07 05:20:41,190 INFO L226 Difference]: Without dead ends: 84 [2021-01-07 05:20:41,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:20:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2021-01-07 05:20:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2021-01-07 05:20:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2021-01-07 05:20:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2021-01-07 05:20:41,194 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 27 [2021-01-07 05:20:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:41,194 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2021-01-07 05:20:41,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-07 05:20:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2021-01-07 05:20:41,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:20:41,195 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:41,195 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:41,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-07 05:20:41,195 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:41,196 INFO L82 PathProgramCache]: Analyzing trace with hash 186745549, now seen corresponding path program 1 times [2021-01-07 05:20:41,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:41,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612157395] [2021-01-07 05:20:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:41,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:41,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:41,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612157395] [2021-01-07 05:20:41,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:41,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:41,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292423496] [2021-01-07 05:20:41,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:20:41,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:41,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:20:41,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:20:41,290 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand 6 states. [2021-01-07 05:20:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:41,434 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-01-07 05:20:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:20:41,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2021-01-07 05:20:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:41,440 INFO L225 Difference]: With dead ends: 80 [2021-01-07 05:20:41,440 INFO L226 Difference]: Without dead ends: 80 [2021-01-07 05:20:41,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:20:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-01-07 05:20:41,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-01-07 05:20:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-07 05:20:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-01-07 05:20:41,447 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 28 [2021-01-07 05:20:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:41,448 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-01-07 05:20:41,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:20:41,449 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-01-07 05:20:41,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:20:41,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:41,449 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:41,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-07 05:20:41,450 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:41,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:41,451 INFO L82 PathProgramCache]: Analyzing trace with hash -973971529, now seen corresponding path program 1 times [2021-01-07 05:20:41,451 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:41,451 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388679926] [2021-01-07 05:20:41,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:42,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388679926] [2021-01-07 05:20:42,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:42,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-01-07 05:20:42,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850362672] [2021-01-07 05:20:42,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:20:42,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:20:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:20:42,579 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 17 states. [2021-01-07 05:20:42,827 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-01-07 05:20:43,247 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-01-07 05:20:43,446 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-01-07 05:20:43,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:43,865 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2021-01-07 05:20:43,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-01-07 05:20:43,866 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2021-01-07 05:20:43,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:43,867 INFO L225 Difference]: With dead ends: 117 [2021-01-07 05:20:43,868 INFO L226 Difference]: Without dead ends: 115 [2021-01-07 05:20:43,868 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:20:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-01-07 05:20:43,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 102. [2021-01-07 05:20:43,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2021-01-07 05:20:43,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2021-01-07 05:20:43,872 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 32 [2021-01-07 05:20:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:43,873 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2021-01-07 05:20:43,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:20:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2021-01-07 05:20:43,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-07 05:20:43,873 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:43,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:43,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:20:43,874 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:43,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -973970341, now seen corresponding path program 1 times [2021-01-07 05:20:43,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:43,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634175433] [2021-01-07 05:20:43,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:43,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634175433] [2021-01-07 05:20:43,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:20:43,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:20:43,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695530869] [2021-01-07 05:20:43,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:20:43,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:43,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:20:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:43,953 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand 5 states. [2021-01-07 05:20:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:43,973 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2021-01-07 05:20:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:20:43,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2021-01-07 05:20:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:43,975 INFO L225 Difference]: With dead ends: 119 [2021-01-07 05:20:43,975 INFO L226 Difference]: Without dead ends: 103 [2021-01-07 05:20:43,975 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:20:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-07 05:20:43,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 86. [2021-01-07 05:20:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2021-01-07 05:20:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 89 transitions. [2021-01-07 05:20:43,978 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 89 transitions. Word has length 32 [2021-01-07 05:20:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:43,979 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 89 transitions. [2021-01-07 05:20:43,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:20:43,979 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 89 transitions. [2021-01-07 05:20:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:20:43,980 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:43,980 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:43,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-07 05:20:43,981 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1880889347, now seen corresponding path program 1 times [2021-01-07 05:20:43,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:43,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67468063] [2021-01-07 05:20:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:20:44,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67468063] [2021-01-07 05:20:44,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948413652] [2021-01-07 05:20:44,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:44,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:44,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 77 conjunts are in the unsatisfiable core [2021-01-07 05:20:44,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:44,594 INFO L382 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-01-07 05:20:44,594 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,603 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,606 INFO L382 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-01-07 05:20:44,607 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,615 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,616 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,616 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:20:44,652 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_48|], 3=[|v_#valid_62|]} [2021-01-07 05:20:44,658 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:20:44,660 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,678 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:44,685 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-01-07 05:20:44,687 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,702 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,703 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,703 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2021-01-07 05:20:44,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:44,802 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,802 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2021-01-07 05:20:44,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:44,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:44,811 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,839 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,843 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:44,843 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:45 [2021-01-07 05:20:44,937 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:20:44,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:44,964 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:44,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:44,966 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:51 [2021-01-07 05:20:45,062 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_28|], 2=[|v_#memory_$Pointer$.offset_27|]} [2021-01-07 05:20:45,068 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:45,068 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,094 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,103 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-01-07 05:20:45,104 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,134 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:45,134 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:63 [2021-01-07 05:20:45,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,283 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,283 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 33 [2021-01-07 05:20:45,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:45,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:45,289 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,313 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,315 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,316 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:78, output treesize:50 [2021-01-07 05:20:45,462 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_29|], 12=[|v_#memory_$Pointer$.offset_28|]} [2021-01-07 05:20:45,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,472 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2021-01-07 05:20:45,474 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,504 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,515 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2021-01-07 05:20:45,519 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,544 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,546 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,546 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2021-01-07 05:20:45,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,631 INFO L382 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 47 treesize of output 23 [2021-01-07 05:20:45,633 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:45,657 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:45,657 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:86, output treesize:56 [2021-01-07 05:20:45,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:45,958 INFO L348 Elim1Store]: treesize reduction 20, result has 44.4 percent of original size [2021-01-07 05:20:45,959 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 60 [2021-01-07 05:20:45,964 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,024 INFO L625 ElimStorePlain]: treesize reduction 13, result has 84.0 percent of original size [2021-01-07 05:20:46,027 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:46,028 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:68 [2021-01-07 05:20:46,149 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_30|], 30=[|v_#memory_$Pointer$.offset_30|]} [2021-01-07 05:20:46,155 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:46,156 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,189 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:46,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:46,209 INFO L348 Elim1Store]: treesize reduction 11, result has 42.1 percent of original size [2021-01-07 05:20:46,209 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 63 [2021-01-07 05:20:46,213 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,240 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,245 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:46,245 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:84, output treesize:69 [2021-01-07 05:20:46,385 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2021-01-07 05:20:46,386 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,407 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:46,408 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:80, output treesize:57 [2021-01-07 05:20:46,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:46,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:46,521 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,521 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 29 [2021-01-07 05:20:46,525 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:46,536 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:46,536 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:63, output treesize:3 [2021-01-07 05:20:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:20:46,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:20:46,557 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-01-07 05:20:46,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003917638] [2021-01-07 05:20:46,558 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:20:46,558 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:20:46,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:20:46,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:20:46,559 INFO L87 Difference]: Start difference. First operand 86 states and 89 transitions. Second operand 31 states. [2021-01-07 05:20:47,343 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-01-07 05:20:47,565 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 48 [2021-01-07 05:20:47,783 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2021-01-07 05:20:47,954 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2021-01-07 05:20:48,224 WARN L197 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 62 [2021-01-07 05:20:48,477 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 58 [2021-01-07 05:20:48,746 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2021-01-07 05:20:49,012 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 64 [2021-01-07 05:20:49,254 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 63 [2021-01-07 05:20:49,575 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 68 [2021-01-07 05:20:49,825 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2021-01-07 05:20:50,171 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2021-01-07 05:20:50,424 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2021-01-07 05:20:50,684 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2021-01-07 05:20:52,543 WARN L197 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 91 DAG size of output: 61 [2021-01-07 05:20:54,896 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 89 [2021-01-07 05:20:55,198 WARN L197 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 91 [2021-01-07 05:20:55,610 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2021-01-07 05:20:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:20:56,165 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2021-01-07 05:20:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-01-07 05:20:56,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2021-01-07 05:20:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:20:56,167 INFO L225 Difference]: With dead ends: 104 [2021-01-07 05:20:56,167 INFO L226 Difference]: Without dead ends: 104 [2021-01-07 05:20:56,169 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=567, Invalid=2739, Unknown=0, NotChecked=0, Total=3306 [2021-01-07 05:20:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-01-07 05:20:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2021-01-07 05:20:56,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2021-01-07 05:20:56,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2021-01-07 05:20:56,172 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 36 [2021-01-07 05:20:56,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:20:56,172 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2021-01-07 05:20:56,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:20:56,172 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2021-01-07 05:20:56,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-01-07 05:20:56,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:20:56,173 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:20:56,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:20:56,383 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:20:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:20:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1821972289, now seen corresponding path program 1 times [2021-01-07 05:20:56,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:20:56,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592147301] [2021-01-07 05:20:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:20:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:20:56,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592147301] [2021-01-07 05:20:56,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168269901] [2021-01-07 05:20:56,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:20:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:20:56,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 72 conjunts are in the unsatisfiable core [2021-01-07 05:20:56,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:20:56,969 INFO L382 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-01-07 05:20:56,970 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,982 INFO L382 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-01-07 05:20:56,983 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:56,992 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:56,992 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:20:57,026 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_50|], 3=[|v_#valid_66|]} [2021-01-07 05:20:57,036 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:20:57,037 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,060 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2021-01-07 05:20:57,062 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,077 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,077 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,078 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:29 [2021-01-07 05:20:57,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,159 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,159 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:20:57,161 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,211 INFO L625 ElimStorePlain]: treesize reduction 14, result has 74.1 percent of original size [2021-01-07 05:20:57,213 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:57,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:40 [2021-01-07 05:20:57,304 INFO L382 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-01-07 05:20:57,304 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,340 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:57,344 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:46 [2021-01-07 05:20:57,454 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_31|], 2=[|v_#memory_$Pointer$.base_32|]} [2021-01-07 05:20:57,460 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:57,461 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,486 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,492 INFO L382 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 19 treesize of output 18 [2021-01-07 05:20:57,494 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,520 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:20:57,521 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:54 [2021-01-07 05:20:57,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,652 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,652 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 45 [2021-01-07 05:20:57,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:57,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:57,659 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:57,687 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,688 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:79 [2021-01-07 05:20:57,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:20:57,960 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_32|], 12=[|v_#memory_$Pointer$.base_33|]} [2021-01-07 05:20:57,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,970 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:57,971 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:20:57,972 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:57,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:57,982 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:20:57,984 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:58,203 WARN L197 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2021-01-07 05:20:58,204 INFO L625 ElimStorePlain]: treesize reduction 3, result has 98.1 percent of original size [2021-01-07 05:20:58,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:58,219 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:20:58,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:58,244 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:58,245 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 59 [2021-01-07 05:20:58,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:58,254 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:58,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:58,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:58,286 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:58,286 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 59 [2021-01-07 05:20:58,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:58,292 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:58,377 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:58,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:20:58,379 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:164, output treesize:145 [2021-01-07 05:20:58,555 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:58,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:58,569 INFO L382 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 26 treesize of output 10 [2021-01-07 05:20:58,570 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:58,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:58,579 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-01-07 05:20:58,580 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:58,656 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:58,658 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:20:58,658 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:173, output treesize:129 [2021-01-07 05:20:58,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 11, 1] term [2021-01-07 05:20:58,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:58,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:59,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:59,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,201 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:59,202 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 148 [2021-01-07 05:20:59,206 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:20:59,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:59,212 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:59,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,261 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:59,261 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 90 [2021-01-07 05:20:59,264 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:20:59,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:59,268 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:59,483 WARN L197 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-01-07 05:20:59,484 INFO L625 ElimStorePlain]: treesize reduction 84, result has 63.9 percent of original size [2021-01-07 05:20:59,486 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:20:59,487 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:157, output treesize:143 [2021-01-07 05:20:59,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:59,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:20:59,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2021-01-07 05:20:59,659 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:20:59,672 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|, v_prenex_2], 20=[v_prenex_4, |v_#memory_$Pointer$.base_35|]} [2021-01-07 05:20:59,683 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:59,684 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:59,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:59,780 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:20:59,781 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:59,861 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:59,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,896 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:59,897 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 76 [2021-01-07 05:20:59,901 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:20:59,974 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:20:59,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:20:59,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:00,006 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:00,007 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 76 [2021-01-07 05:21:00,011 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:00,074 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:00,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:21:00,077 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:175, output treesize:209 [2021-01-07 05:21:00,224 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:00,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2021-01-07 05:21:00,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:00,259 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 75 [2021-01-07 05:21:00,261 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:00,304 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:00,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 71 [2021-01-07 05:21:00,311 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:00,365 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:00,367 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2021-01-07 05:21:00,367 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:231, output treesize:177 [2021-01-07 05:21:00,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:00,565 INFO L348 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2021-01-07 05:21:00,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 78 [2021-01-07 05:21:00,571 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:21:00,572 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,574 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,576 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,577 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:21:00,580 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,582 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,584 INFO L639 QuantifierPusher]: Distributing 6 conjuncts over 2 disjuncts [2021-01-07 05:21:00,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:00,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:00,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:00,590 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2021-01-07 05:21:00,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:00,592 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2021-01-07 05:21:00,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:00,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:00,599 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2021-01-07 05:21:00,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:00,610 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2021-01-07 05:21:00,672 INFO L625 ElimStorePlain]: treesize reduction 34, result has 75.2 percent of original size [2021-01-07 05:21:00,735 INFO L348 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2021-01-07 05:21:00,735 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 80 [2021-01-07 05:21:00,741 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:21:00,742 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:00,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:21:00,747 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:21:00,750 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:00,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:00,763 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:21:00,763 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:189, output treesize:9 [2021-01-07 05:21:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:00,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:00,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2021-01-07 05:21:00,796 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996874716] [2021-01-07 05:21:00,796 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-01-07 05:21:00,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:00,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-01-07 05:21:00,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=838, Unknown=0, NotChecked=0, Total=930 [2021-01-07 05:21:00,798 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand 31 states. [2021-01-07 05:21:01,654 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2021-01-07 05:21:01,897 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2021-01-07 05:21:02,284 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 69 [2021-01-07 05:21:02,597 WARN L197 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2021-01-07 05:21:02,958 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2021-01-07 05:21:03,339 WARN L197 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2021-01-07 05:21:03,722 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2021-01-07 05:21:04,155 WARN L197 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 69 [2021-01-07 05:21:04,500 WARN L197 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2021-01-07 05:21:04,994 WARN L197 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2021-01-07 05:21:05,204 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2021-01-07 05:21:05,772 WARN L197 SmtUtils]: Spent 463.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2021-01-07 05:21:06,162 WARN L197 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 66 [2021-01-07 05:21:06,511 WARN L197 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2021-01-07 05:21:06,766 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-01-07 05:21:07,171 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2021-01-07 05:21:07,546 WARN L197 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2021-01-07 05:21:07,940 WARN L197 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 74 [2021-01-07 05:21:08,144 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-01-07 05:21:08,657 WARN L197 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 81 [2021-01-07 05:21:08,869 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2021-01-07 05:21:09,281 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2021-01-07 05:21:09,769 WARN L197 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 113 [2021-01-07 05:21:10,337 WARN L197 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 116 [2021-01-07 05:21:10,837 WARN L197 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 77 [2021-01-07 05:21:11,483 WARN L197 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 77 [2021-01-07 05:21:12,122 WARN L197 SmtUtils]: Spent 449.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 81 [2021-01-07 05:21:12,439 WARN L197 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2021-01-07 05:21:13,045 WARN L197 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2021-01-07 05:21:13,643 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2021-01-07 05:21:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:14,421 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2021-01-07 05:21:14,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-01-07 05:21:14,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2021-01-07 05:21:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:14,423 INFO L225 Difference]: With dead ends: 114 [2021-01-07 05:21:14,423 INFO L226 Difference]: Without dead ends: 114 [2021-01-07 05:21:14,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1096 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=874, Invalid=4096, Unknown=0, NotChecked=0, Total=4970 [2021-01-07 05:21:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-01-07 05:21:14,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 84. [2021-01-07 05:21:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2021-01-07 05:21:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2021-01-07 05:21:14,428 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 37 [2021-01-07 05:21:14,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:14,429 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2021-01-07 05:21:14,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2021-01-07 05:21:14,429 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2021-01-07 05:21:14,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-01-07 05:21:14,429 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:14,430 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:14,643 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:14,644 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:21:14,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -646566011, now seen corresponding path program 1 times [2021-01-07 05:21:14,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:14,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336164747] [2021-01-07 05:21:14,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:15,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:21:15,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336164747] [2021-01-07 05:21:15,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341781971] [2021-01-07 05:21:15,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:15,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 79 conjunts are in the unsatisfiable core [2021-01-07 05:21:15,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:15,303 INFO L382 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-01-07 05:21:15,304 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,314 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,318 INFO L382 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-01-07 05:21:15,318 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,327 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,328 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,328 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:21:15,369 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_52|], 3=[|v_#valid_70|]} [2021-01-07 05:21:15,373 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:21:15,375 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,411 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,431 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,432 INFO L382 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 39 [2021-01-07 05:21:15,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:15,437 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,453 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,454 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,454 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2021-01-07 05:21:15,556 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,556 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 50 [2021-01-07 05:21:15,558 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,611 INFO L625 ElimStorePlain]: treesize reduction 28, result has 55.6 percent of original size [2021-01-07 05:21:15,612 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,612 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:35 [2021-01-07 05:21:15,680 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:21:15,681 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,704 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,706 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,706 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2021-01-07 05:21:15,781 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_34|], 2=[|v_#memory_$Pointer$.base_37|]} [2021-01-07 05:21:15,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:21:15,787 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,809 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-01-07 05:21:15,818 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,837 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,839 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:49 [2021-01-07 05:21:15,901 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_53|], 10=[|v_#valid_72|]} [2021-01-07 05:21:15,907 INFO L382 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-01-07 05:21:15,907 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:15,939 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:15,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:16,028 INFO L348 Elim1Store]: treesize reduction 20, result has 86.8 percent of original size [2021-01-07 05:21:16,029 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 153 [2021-01-07 05:21:16,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:16,033 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:16,036 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,071 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:16,073 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,073 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:77, output treesize:90 [2021-01-07 05:21:16,324 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-01-07 05:21:16,345 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_35|], 12=[|v_#memory_$Pointer$.base_38|]} [2021-01-07 05:21:16,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:16,354 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:21:16,355 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,404 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:16,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:16,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:16,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:16,416 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:16,416 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 47 [2021-01-07 05:21:16,418 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:16,465 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,466 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:123, output treesize:115 [2021-01-07 05:21:16,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:16,617 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-01-07 05:21:16,618 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,671 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:16,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:16,673 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:129, output treesize:107 [2021-01-07 05:21:17,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:17,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:17,032 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:17,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:17,044 INFO L348 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-01-07 05:21:17,044 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 59 [2021-01-07 05:21:17,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:17,089 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:17,091 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:17,092 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:118, output treesize:114 [2021-01-07 05:21:19,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:19,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:19,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:19,904 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:19,909 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:19,909 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 70 [2021-01-07 05:21:19,912 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:19,953 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:19,957 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:19,957 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:119, output treesize:141 [2021-01-07 05:21:20,331 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-01-07 05:21:20,332 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,379 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:20,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:159, output treesize:148 [2021-01-07 05:21:20,494 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2021-01-07 05:21:20,495 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:20,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,540 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:20,541 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:20,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:20,544 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:21:20,570 INFO L348 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2021-01-07 05:21:20,570 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 131 treesize of output 64 [2021-01-07 05:21:20,577 INFO L547 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:20,604 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:20,609 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:21:20,610 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:165, output treesize:38 [2021-01-07 05:21:20,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:20,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:21:20,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2021-01-07 05:21:20,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46494694] [2021-01-07 05:21:20,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-01-07 05:21:20,731 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:21:20,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-01-07 05:21:20,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=996, Unknown=4, NotChecked=0, Total=1122 [2021-01-07 05:21:20,732 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand 34 states. [2021-01-07 05:21:21,455 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2021-01-07 05:21:21,664 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 58 [2021-01-07 05:21:21,936 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 64 [2021-01-07 05:21:22,729 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-01-07 05:21:24,875 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2021-01-07 05:21:26,344 WARN L197 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-01-07 05:21:28,952 WARN L197 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2021-01-07 05:21:30,472 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2021-01-07 05:21:31,905 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-01-07 05:21:33,418 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2021-01-07 05:21:35,369 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2021-01-07 05:21:36,926 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 61 [2021-01-07 05:21:37,156 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2021-01-07 05:21:37,425 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2021-01-07 05:21:37,715 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 68 [2021-01-07 05:21:37,939 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 77 [2021-01-07 05:21:38,215 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 76 [2021-01-07 05:21:38,404 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2021-01-07 05:21:38,784 WARN L197 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 80 [2021-01-07 05:21:39,021 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-07 05:21:40,244 WARN L197 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2021-01-07 05:21:40,519 WARN L197 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 102 [2021-01-07 05:21:41,801 WARN L197 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 121 [2021-01-07 05:21:43,450 WARN L197 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2021-01-07 05:21:45,483 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2021-01-07 05:21:53,467 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2021-01-07 05:21:55,307 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 81 [2021-01-07 05:21:56,395 WARN L197 SmtUtils]: Spent 983.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2021-01-07 05:21:56,699 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 83 [2021-01-07 05:21:57,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:21:57,062 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2021-01-07 05:21:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-01-07 05:21:57,062 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 38 [2021-01-07 05:21:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:21:57,063 INFO L225 Difference]: With dead ends: 97 [2021-01-07 05:21:57,063 INFO L226 Difference]: Without dead ends: 97 [2021-01-07 05:21:57,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=911, Invalid=3902, Unknown=17, NotChecked=0, Total=4830 [2021-01-07 05:21:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-01-07 05:21:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2021-01-07 05:21:57,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2021-01-07 05:21:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 86 transitions. [2021-01-07 05:21:57,072 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 86 transitions. Word has length 38 [2021-01-07 05:21:57,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:21:57,073 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 86 transitions. [2021-01-07 05:21:57,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2021-01-07 05:21:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 86 transitions. [2021-01-07 05:21:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-01-07 05:21:57,073 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:21:57,073 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:21:57,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-01-07 05:21:57,274 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:21:57,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:21:57,275 INFO L82 PathProgramCache]: Analyzing trace with hash -867670517, now seen corresponding path program 1 times [2021-01-07 05:21:57,275 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:21:57,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846975575] [2021-01-07 05:21:57,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:21:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:21:57,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846975575] [2021-01-07 05:21:57,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582117474] [2021-01-07 05:21:57,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:21:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:21:58,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 82 conjunts are in the unsatisfiable core [2021-01-07 05:21:58,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:21:58,058 INFO L382 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-01-07 05:21:58,059 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,068 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,071 INFO L382 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-01-07 05:21:58,072 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,080 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,081 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,081 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:21:58,124 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_55|], 3=[|v_#valid_74|]} [2021-01-07 05:21:58,130 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:21:58,131 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,147 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,169 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,169 INFO L382 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 39 [2021-01-07 05:21:58,171 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:58,176 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,194 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2021-01-07 05:21:58,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:58,310 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,311 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2021-01-07 05:21:58,313 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,370 INFO L625 ElimStorePlain]: treesize reduction 14, result has 72.5 percent of original size [2021-01-07 05:21:58,372 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,372 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:37 [2021-01-07 05:21:58,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:21:58,469 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,500 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,502 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,502 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:49 [2021-01-07 05:21:58,609 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_36|], 2=[|v_#memory_$Pointer$.base_42|]} [2021-01-07 05:21:58,616 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:21:58,617 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,645 INFO L382 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 30 treesize of output 25 [2021-01-07 05:21:58,647 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,671 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,672 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:59 [2021-01-07 05:21:58,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:58,899 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2021-01-07 05:21:58,900 INFO L348 Elim1Store]: treesize reduction 20, result has 87.7 percent of original size [2021-01-07 05:21:58,900 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 159 [2021-01-07 05:21:58,903 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:21:58,905 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:21:58,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:21:58,910 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,959 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:58,960 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:58,961 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:79, output treesize:97 [2021-01-07 05:21:59,277 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2021-01-07 05:21:59,286 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_37|], 12=[|v_#memory_$Pointer$.base_43|]} [2021-01-07 05:21:59,293 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:21:59,295 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,355 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:59,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:59,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:21:59,368 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:59,368 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 52 [2021-01-07 05:21:59,371 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,428 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:59,430 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,430 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:130, output treesize:118 [2021-01-07 05:21:59,596 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-01-07 05:21:59,598 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,655 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:21:59,657 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:21:59,658 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:132, output treesize:114 [2021-01-07 05:22:00,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,114 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:00,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:00,132 INFO L348 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-01-07 05:22:00,133 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 64 [2021-01-07 05:22:00,135 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:00,188 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:00,191 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:00,191 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:125, output treesize:121 [2021-01-07 05:22:02,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:02,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:02,171 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:02,177 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:02,178 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 75 [2021-01-07 05:22:02,180 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:02,267 INFO L625 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2021-01-07 05:22:02,270 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:02,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:126, output treesize:138 [2021-01-07 05:22:02,963 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-01-07 05:22:02,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:03,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:03,086 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:03,087 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 334 [2021-01-07 05:22:03,091 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:03,261 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-01-07 05:22:03,262 INFO L625 ElimStorePlain]: treesize reduction 140, result has 64.2 percent of original size [2021-01-07 05:22:03,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,278 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:03,279 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:158, output treesize:251 [2021-01-07 05:22:03,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,435 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,437 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,439 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,441 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,454 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,459 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,464 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,471 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,476 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,500 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,506 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,507 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,508 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,513 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,515 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,516 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,523 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,525 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,528 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,529 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,531 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,539 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,571 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,587 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,599 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,612 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,615 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,624 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,663 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,666 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,667 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,671 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,672 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,674 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,687 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,696 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,697 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,710 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,715 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,716 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,727 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,756 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:03,788 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,790 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,794 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,806 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,816 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,828 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,849 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,854 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,894 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,895 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,899 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:03,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,913 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,915 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:03,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,925 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,929 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,931 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,938 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,955 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:03,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:03,969 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,975 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,977 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:03,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:03,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:03,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:03,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,002 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,006 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:04,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:04,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,018 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:04,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,025 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:04,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,039 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:04,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,052 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,054 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:04,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:04,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:04,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:04,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,087 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:04,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,127 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,129 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,141 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,146 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,150 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:04,152 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:04,156 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,162 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:04,178 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:04,182 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2021-01-07 05:22:04,183 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 12 disjuncts [2021-01-07 05:22:04,188 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 14 disjuncts [2021-01-07 05:22:04,216 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 18=[|#memory_$Pointer$.base|]} [2021-01-07 05:22:04,226 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 80 [2021-01-07 05:22:04,228 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,237 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2021-01-07 05:22:04,239 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,249 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2021-01-07 05:22:04,250 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,260 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 76 [2021-01-07 05:22:04,261 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,272 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2021-01-07 05:22:04,273 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,283 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 57 [2021-01-07 05:22:04,285 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 70 [2021-01-07 05:22:04,297 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,310 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 42 [2021-01-07 05:22:04,312 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2021-01-07 05:22:04,327 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,336 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2021-01-07 05:22:04,338 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,346 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2021-01-07 05:22:04,348 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,357 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 55 [2021-01-07 05:22:04,359 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,370 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2021-01-07 05:22:04,371 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,381 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-01-07 05:22:04,383 INFO L547 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,392 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 93 [2021-01-07 05:22:04,395 INFO L547 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:04,403 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 59 [2021-01-07 05:22:04,404 INFO L547 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-01-07 05:22:05,096 WARN L197 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2021-01-07 05:22:05,097 INFO L625 ElimStorePlain]: treesize reduction 1916, result has 30.8 percent of original size [2021-01-07 05:22:05,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:05,138 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,139 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,192 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:05,193 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 136 treesize of output 110 [2021-01-07 05:22:05,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,199 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,200 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:05,204 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:05,208 INFO L547 ElimStorePlain]: Start of recursive call 18: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:05,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:05,244 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,246 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,292 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:05,293 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 146 treesize of output 116 [2021-01-07 05:22:05,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,299 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,301 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,303 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:22:05,306 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,306 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,308 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,310 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:05,313 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,314 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,315 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,316 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:22:05,319 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,321 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,322 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:22:05,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:05,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:22:05,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:22:05,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,344 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,346 INFO L547 ElimStorePlain]: Start of recursive call 19: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:05,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:05,382 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,383 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,439 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:05,440 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 116 treesize of output 100 [2021-01-07 05:22:05,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,448 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,458 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,459 INFO L547 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:05,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:05,499 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,500 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,570 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:05,570 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 147 treesize of output 115 [2021-01-07 05:22:05,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,575 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,576 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,576 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,579 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,581 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:05,585 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,586 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,588 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:05,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,592 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:22:05,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,597 INFO L547 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:05,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:05,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,641 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,695 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:05,695 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 120 treesize of output 106 [2021-01-07 05:22:05,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,699 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,706 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,711 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,712 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,713 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,713 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:05,716 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,717 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,717 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:05,720 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,721 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,722 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,729 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,730 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,732 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,733 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,734 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,736 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,736 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,737 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:05,738 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,740 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,741 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,742 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,743 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:05,744 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,745 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,746 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,748 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,751 INFO L547 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:05,765 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:22:05,771 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:22:05,823 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:22:05,824 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 126 treesize of output 106 [2021-01-07 05:22:05,828 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,829 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,830 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,832 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,834 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,835 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,835 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:22:05,836 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,837 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,838 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,838 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,839 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:05,841 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:05,841 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,843 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,847 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,848 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,849 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:05,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,852 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:05,854 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,857 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,858 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,860 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,863 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,864 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:22:05,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,866 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:22:05,870 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:05,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:22:05,872 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:22:05,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,876 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:22:05,878 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2021-01-07 05:22:05,878 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:22:05,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:22:05,881 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:22:05,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:22:05,883 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:22:05,884 INFO L547 ElimStorePlain]: Start of recursive call 23: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:22:06,389 WARN L197 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 96 [2021-01-07 05:22:06,390 INFO L625 ElimStorePlain]: treesize reduction 100, result has 74.0 percent of original size [2021-01-07 05:22:06,409 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 18 dim-0 vars, and 6 xjuncts. [2021-01-07 05:22:06,409 INFO L244 ElimStorePlain]: Needed 23 recursive calls to eliminate 4 variables, input treesize:3073, output treesize:311 [2021-01-07 05:22:24,439 WARN L197 SmtUtils]: Spent 17.83 s on a formula simplification. DAG size of input: 133 DAG size of output: 104 [2021-01-07 05:22:24,606 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:22:24,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:22:24,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2021-01-07 05:22:24,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855873940] [2021-01-07 05:22:24,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 39 states [2021-01-07 05:22:24,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:22:24,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2021-01-07 05:22:24,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1324, Unknown=3, NotChecked=0, Total=1482 [2021-01-07 05:22:24,609 INFO L87 Difference]: Start difference. First operand 83 states and 86 transitions. Second operand 39 states. [2021-01-07 05:22:25,185 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-07 05:22:25,555 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-01-07 05:22:25,801 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2021-01-07 05:22:26,057 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2021-01-07 05:22:26,382 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2021-01-07 05:22:28,813 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2021-01-07 05:22:30,745 WARN L197 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2021-01-07 05:22:32,794 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2021-01-07 05:22:37,133 WARN L197 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2021-01-07 05:22:39,349 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-01-07 05:22:43,483 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2021-01-07 05:22:47,065 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2021-01-07 05:22:49,304 WARN L197 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-01-07 05:22:51,633 WARN L197 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2021-01-07 05:22:55,898 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2021-01-07 05:22:56,182 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2021-01-07 05:22:56,546 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-01-07 05:22:57,448 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2021-01-07 05:22:57,743 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 81 [2021-01-07 05:22:58,024 WARN L197 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2021-01-07 05:22:58,337 WARN L197 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2021-01-07 05:22:58,765 WARN L197 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 78 [2021-01-07 05:22:59,090 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2021-01-07 05:23:02,681 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2021-01-07 05:23:02,980 WARN L197 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2021-01-07 05:23:04,984 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2021-01-07 05:23:08,568 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 75 [2021-01-07 05:23:11,770 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2021-01-07 05:23:15,807 WARN L197 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2021-01-07 05:23:16,039 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2021-01-07 05:23:17,857 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2021-01-07 05:23:20,016 WARN L197 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 167 DAG size of output: 134 [2021-01-07 05:23:22,374 WARN L197 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 103 DAG size of output: 88 [2021-01-07 05:23:24,399 WARN L197 SmtUtils]: Spent 1.91 s on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2021-01-07 05:23:26,674 WARN L197 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 95 DAG size of output: 80 [2021-01-07 05:23:27,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:23:27,147 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2021-01-07 05:23:27,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-01-07 05:23:27,148 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2021-01-07 05:23:27,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:23:27,149 INFO L225 Difference]: With dead ends: 96 [2021-01-07 05:23:27,149 INFO L226 Difference]: Without dead ends: 96 [2021-01-07 05:23:27,156 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1497 ImplicationChecksByTransitivity, 62.1s TimeCoverageRelationStatistics Valid=1057, Invalid=5246, Unknown=17, NotChecked=0, Total=6320 [2021-01-07 05:23:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2021-01-07 05:23:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2021-01-07 05:23:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-01-07 05:23:27,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2021-01-07 05:23:27,160 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 42 [2021-01-07 05:23:27,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:23:27,161 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2021-01-07 05:23:27,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2021-01-07 05:23:27,161 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2021-01-07 05:23:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:23:27,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:23:27,162 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:23:27,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-01-07 05:23:27,377 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:23:27,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:23:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1062288981, now seen corresponding path program 1 times [2021-01-07 05:23:27,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:23:27,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903023881] [2021-01-07 05:23:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:23:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:27,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:27,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903023881] [2021-01-07 05:23:27,470 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314284773] [2021-01-07 05:23:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:23:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:27,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-07 05:23:27,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:23:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:27,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:23:27,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2021-01-07 05:23:27,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093914628] [2021-01-07 05:23:27,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:23:27,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:23:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:23:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:23:27,661 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 5 states. [2021-01-07 05:23:27,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:23:27,688 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2021-01-07 05:23:27,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:23:27,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2021-01-07 05:23:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:23:27,689 INFO L225 Difference]: With dead ends: 77 [2021-01-07 05:23:27,690 INFO L226 Difference]: Without dead ends: 77 [2021-01-07 05:23:27,690 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:23:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-07 05:23:27,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2021-01-07 05:23:27,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-07 05:23:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2021-01-07 05:23:27,692 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 44 [2021-01-07 05:23:27,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:23:27,693 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2021-01-07 05:23:27,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:23:27,693 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2021-01-07 05:23:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-01-07 05:23:27,693 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:23:27,694 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:23:27,907 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:23:27,908 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:23:27,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:23:27,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1062290169, now seen corresponding path program 1 times [2021-01-07 05:23:27,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:23:27,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075273415] [2021-01-07 05:23:27,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:23:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:27,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075273415] [2021-01-07 05:23:27,991 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869677308] [2021-01-07 05:23:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:23:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:28,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 33 conjunts are in the unsatisfiable core [2021-01-07 05:23:28,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:23:28,100 INFO L382 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-01-07 05:23:28,101 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,109 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,113 INFO L382 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-01-07 05:23:28,114 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,123 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,124 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,125 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2021-01-07 05:23:28,153 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_57|], 1=[|v_#valid_79|]} [2021-01-07 05:23:28,157 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:23:28,159 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,185 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,186 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2021-01-07 05:23:28,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:28,190 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,201 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,202 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,203 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2021-01-07 05:23:28,249 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:23:28,250 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,261 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,262 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,262 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:20 [2021-01-07 05:23:28,384 INFO L348 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-01-07 05:23:28,385 INFO L382 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 32 treesize of output 23 [2021-01-07 05:23:28,395 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,405 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,406 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:28,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2021-01-07 05:23:28,471 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,472 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2021-01-07 05:23:28,473 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,479 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:28,481 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:28,481 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2021-01-07 05:23:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:28,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:23:28,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2021-01-07 05:23:28,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219178562] [2021-01-07 05:23:28,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-01-07 05:23:28,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:23:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-01-07 05:23:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2021-01-07 05:23:28,507 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 14 states. [2021-01-07 05:23:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:23:39,034 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2021-01-07 05:23:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-01-07 05:23:39,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2021-01-07 05:23:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:23:39,036 INFO L225 Difference]: With dead ends: 65 [2021-01-07 05:23:39,036 INFO L226 Difference]: Without dead ends: 65 [2021-01-07 05:23:39,036 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=158, Invalid=389, Unknown=5, NotChecked=0, Total=552 [2021-01-07 05:23:39,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-01-07 05:23:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2021-01-07 05:23:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-01-07 05:23:39,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2021-01-07 05:23:39,039 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 44 [2021-01-07 05:23:39,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:23:39,039 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2021-01-07 05:23:39,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-01-07 05:23:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2021-01-07 05:23:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:23:39,039 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:23:39,040 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:23:39,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:23:39,244 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:23:39,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:23:39,245 INFO L82 PathProgramCache]: Analyzing trace with hash -938475181, now seen corresponding path program 1 times [2021-01-07 05:23:39,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:23:39,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866864931] [2021-01-07 05:23:39,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:23:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:40,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866864931] [2021-01-07 05:23:40,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435872818] [2021-01-07 05:23:40,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:23:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:40,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 97 conjunts are in the unsatisfiable core [2021-01-07 05:23:40,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:23:40,620 INFO L382 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-01-07 05:23:40,621 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,635 INFO L382 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-01-07 05:23:40,636 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,646 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,647 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,647 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:23:40,709 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_59|], 3=[|v_#valid_81|]} [2021-01-07 05:23:40,714 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:23:40,717 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,737 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,760 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,761 INFO L382 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 39 [2021-01-07 05:23:40,762 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:40,765 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,784 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,785 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,785 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:30 [2021-01-07 05:23:40,942 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,942 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2021-01-07 05:23:40,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:23:40,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:40,947 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:40,979 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:40,980 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:43 [2021-01-07 05:23:41,102 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-01-07 05:23:41,103 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,133 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:41,135 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,135 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:56, output treesize:61 [2021-01-07 05:23:41,240 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_38|], 2=[|v_#memory_$Pointer$.base_49|]} [2021-01-07 05:23:41,245 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:23:41,246 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:41,276 INFO L382 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 37 treesize of output 28 [2021-01-07 05:23:41,278 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,303 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:41,304 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,304 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:77 [2021-01-07 05:23:41,481 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:41,481 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 159 [2021-01-07 05:23:41,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:23:41,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:23:41,488 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:41,490 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:41,552 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:41,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:97, output treesize:115 [2021-01-07 05:23:41,938 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2021-01-07 05:23:41,949 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_39|], 12=[|v_#memory_$Pointer$.base_50|]} [2021-01-07 05:23:41,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:23:41,961 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:42,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:42,036 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:42,037 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 55 [2021-01-07 05:23:42,038 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,100 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:42,102 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,102 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:145, output treesize:133 [2021-01-07 05:23:42,295 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-01-07 05:23:42,297 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,352 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:42,353 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:147, output treesize:129 [2021-01-07 05:23:42,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:42,934 INFO L348 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2021-01-07 05:23:42,935 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 99 [2021-01-07 05:23:42,938 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,992 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:42,994 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:42,994 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:135, output treesize:115 [2021-01-07 05:23:43,167 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:43,168 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 76 [2021-01-07 05:23:43,171 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:43,266 INFO L625 ElimStorePlain]: treesize reduction 4, result has 96.2 percent of original size [2021-01-07 05:23:43,268 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:43,268 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:120, output treesize:146 [2021-01-07 05:23:44,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:44,254 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:44,255 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 300 [2021-01-07 05:23:44,258 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,430 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2021-01-07 05:23:44,431 INFO L625 ElimStorePlain]: treesize reduction 136, result has 66.7 percent of original size [2021-01-07 05:23:44,432 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:181, output treesize:272 [2021-01-07 05:23:44,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:23:44,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:23:44,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:23:44,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:23:44,634 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:23:44,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:23:44,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:23:44,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:23:44,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:23:44,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:23:44,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:23:44,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:23:44,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:23:44,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:23:44,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:23:44,663 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 102 [2021-01-07 05:23:44,664 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,674 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 60 [2021-01-07 05:23:44,675 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,686 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2021-01-07 05:23:44,687 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,697 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2021-01-07 05:23:44,699 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,709 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-01-07 05:23:44,710 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 89 [2021-01-07 05:23:44,722 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,733 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2021-01-07 05:23:44,734 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,745 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2021-01-07 05:23:44,747 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,757 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 72 [2021-01-07 05:23:44,759 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,770 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 51 [2021-01-07 05:23:44,771 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,786 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2021-01-07 05:23:44,788 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,800 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2021-01-07 05:23:44,802 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,813 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 47 [2021-01-07 05:23:44,814 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,825 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 81 [2021-01-07 05:23:44,827 INFO L547 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,838 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 68 [2021-01-07 05:23:44,840 INFO L547 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:44,849 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2021-01-07 05:23:44,851 INFO L547 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:45,494 WARN L197 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2021-01-07 05:23:45,495 INFO L625 ElimStorePlain]: treesize reduction 2345, result has 24.9 percent of original size [2021-01-07 05:23:45,498 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2021-01-07 05:23:45,498 INFO L244 ElimStorePlain]: Needed 17 recursive calls to eliminate 1 variables, input treesize:3489, output treesize:776 [2021-01-07 05:23:45,914 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-01-07 05:23:46,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:46,274 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:46,275 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 159 [2021-01-07 05:23:46,278 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:46,343 INFO L625 ElimStorePlain]: treesize reduction 48, result has 70.6 percent of original size [2021-01-07 05:23:46,344 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:46,344 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:125, output treesize:115 [2021-01-07 05:23:46,509 INFO L348 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2021-01-07 05:23:46,509 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 82 [2021-01-07 05:23:46,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:23:46,513 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:46,542 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:46,544 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:46,544 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:123, output treesize:79 [2021-01-07 05:23:46,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:46,743 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:46,743 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 39 [2021-01-07 05:23:46,746 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:46,761 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:46,764 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:46,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:34 [2021-01-07 05:23:46,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:46,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:23:46,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2021-01-07 05:23:46,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802498477] [2021-01-07 05:23:46,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 51 states [2021-01-07 05:23:46,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:23:46,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2021-01-07 05:23:46,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2327, Unknown=0, NotChecked=0, Total=2550 [2021-01-07 05:23:46,939 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 51 states. [2021-01-07 05:23:49,222 WARN L197 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2021-01-07 05:23:49,527 WARN L197 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2021-01-07 05:23:49,915 WARN L197 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2021-01-07 05:23:50,190 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-01-07 05:23:50,574 WARN L197 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2021-01-07 05:23:50,849 WARN L197 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2021-01-07 05:23:51,290 WARN L197 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 93 [2021-01-07 05:23:51,590 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-01-07 05:23:51,976 WARN L197 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2021-01-07 05:23:52,219 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2021-01-07 05:23:52,654 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2021-01-07 05:23:53,142 WARN L197 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 97 [2021-01-07 05:23:53,434 WARN L197 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2021-01-07 05:23:53,778 WARN L197 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2021-01-07 05:23:54,209 WARN L197 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2021-01-07 05:23:54,531 WARN L197 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2021-01-07 05:23:55,048 WARN L197 SmtUtils]: Spent 417.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 71 [2021-01-07 05:23:55,503 WARN L197 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 86 [2021-01-07 05:23:55,918 WARN L197 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 76 [2021-01-07 05:23:56,454 WARN L197 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 73 [2021-01-07 05:23:57,046 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2021-01-07 05:23:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:23:57,559 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2021-01-07 05:23:57,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-01-07 05:23:57,560 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2021-01-07 05:23:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:23:57,561 INFO L225 Difference]: With dead ends: 87 [2021-01-07 05:23:57,561 INFO L226 Difference]: Without dead ends: 87 [2021-01-07 05:23:57,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=918, Invalid=6564, Unknown=0, NotChecked=0, Total=7482 [2021-01-07 05:23:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-01-07 05:23:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2021-01-07 05:23:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-07 05:23:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2021-01-07 05:23:57,567 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 47 [2021-01-07 05:23:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:23:57,567 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2021-01-07 05:23:57,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2021-01-07 05:23:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2021-01-07 05:23:57,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-01-07 05:23:57,568 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:23:57,568 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:23:57,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:23:57,783 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:23:57,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:23:57,784 INFO L82 PathProgramCache]: Analyzing trace with hash -938475180, now seen corresponding path program 1 times [2021-01-07 05:23:57,784 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:23:57,784 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234386194] [2021-01-07 05:23:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:23:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:23:58,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234386194] [2021-01-07 05:23:58,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788997007] [2021-01-07 05:23:58,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:23:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:23:58,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 78 conjunts are in the unsatisfiable core [2021-01-07 05:23:58,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:23:58,444 INFO L382 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-01-07 05:23:58,445 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,454 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,461 INFO L382 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-01-07 05:23:58,462 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,471 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,472 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,473 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:23:58,526 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_61|], 1=[|v_#valid_87|]} [2021-01-07 05:23:58,531 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:23:58,532 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,551 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,562 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,562 INFO L382 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 15 [2021-01-07 05:23:58,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:58,566 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,585 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,585 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:16 [2021-01-07 05:23:58,657 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:23:58,658 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,668 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,668 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,669 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-01-07 05:23:58,886 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_54|], 6=[|v_#memory_$Pointer$.offset_41|]} [2021-01-07 05:23:58,891 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:23:58,892 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,918 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,937 INFO L348 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-01-07 05:23:58,938 INFO L382 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:23:58,939 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:58,963 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:58,964 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2021-01-07 05:23:59,236 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_55|], 6=[|v_#memory_$Pointer$.offset_42|]} [2021-01-07 05:23:59,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:59,244 INFO L382 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 28 [2021-01-07 05:23:59,245 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:59,278 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:59,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:23:59,291 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:59,291 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2021-01-07 05:23:59,295 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:59,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:59,329 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:23:59,329 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:45 [2021-01-07 05:23:59,340 INFO L443 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_56|], 6=[|v_#memory_$Pointer$.offset_43|]} [2021-01-07 05:23:59,362 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:59,363 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 42 [2021-01-07 05:23:59,364 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,366 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:59,434 INFO L625 ElimStorePlain]: treesize reduction 12, result has 83.6 percent of original size [2021-01-07 05:23:59,467 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:23:59,467 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 52 [2021-01-07 05:23:59,469 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:23:59,534 INFO L625 ElimStorePlain]: treesize reduction 16, result has 73.3 percent of original size [2021-01-07 05:23:59,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,536 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:23:59,536 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:49 [2021-01-07 05:23:59,547 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,811 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:23:59,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:00,176 WARN L197 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2021-01-07 05:24:00,181 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 1] term [2021-01-07 05:24:00,181 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:00,985 WARN L197 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2021-01-07 05:24:00,989 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:01,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:01,086 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:01,086 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 66 [2021-01-07 05:24:01,088 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:01,107 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:01,135 INFO L348 Elim1Store]: treesize reduction 16, result has 50.0 percent of original size [2021-01-07 05:24:01,136 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 54 [2021-01-07 05:24:01,137 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:24:01,141 INFO L547 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:01,156 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:01,157 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:01,157 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:90, output treesize:47 [2021-01-07 05:24:01,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:01,287 INFO L382 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 12 [2021-01-07 05:24:01,288 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:01,302 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:01,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:01,309 INFO L382 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 26 treesize of output 10 [2021-01-07 05:24:01,310 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:01,319 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:01,322 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:01,322 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:9 [2021-01-07 05:24:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:01,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:01,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2021-01-07 05:24:01,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093482177] [2021-01-07 05:24:01,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:24:01,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:24:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:24:01,355 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 33 states. [2021-01-07 05:24:02,915 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2021-01-07 05:24:03,343 WARN L197 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2021-01-07 05:24:03,608 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2021-01-07 05:24:03,894 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2021-01-07 05:24:04,128 WARN L197 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2021-01-07 05:24:04,382 WARN L197 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2021-01-07 05:24:04,606 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2021-01-07 05:24:04,788 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2021-01-07 05:24:04,957 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2021-01-07 05:24:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:05,454 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2021-01-07 05:24:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:24:05,455 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2021-01-07 05:24:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:05,456 INFO L225 Difference]: With dead ends: 79 [2021-01-07 05:24:05,456 INFO L226 Difference]: Without dead ends: 79 [2021-01-07 05:24:05,459 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=500, Invalid=2470, Unknown=0, NotChecked=0, Total=2970 [2021-01-07 05:24:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2021-01-07 05:24:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2021-01-07 05:24:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-01-07 05:24:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2021-01-07 05:24:05,461 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 47 [2021-01-07 05:24:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:05,461 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2021-01-07 05:24:05,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2021-01-07 05:24:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2021-01-07 05:24:05,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-01-07 05:24:05,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:05,462 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:05,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:05,663 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:24:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:05,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2123050326, now seen corresponding path program 1 times [2021-01-07 05:24:05,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:05,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824174354] [2021-01-07 05:24:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:06,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:06,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824174354] [2021-01-07 05:24:06,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987164347] [2021-01-07 05:24:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:06,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 67 conjunts are in the unsatisfiable core [2021-01-07 05:24:06,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:06,193 INFO L382 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-01-07 05:24:06,195 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,207 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,212 INFO L382 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-01-07 05:24:06,213 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,224 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,225 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,225 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:24:06,266 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_63|], 1=[|v_#valid_89|]} [2021-01-07 05:24:06,271 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:24:06,272 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,289 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,300 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,300 INFO L382 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 15 [2021-01-07 05:24:06,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:06,304 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,318 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,319 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,320 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:16 [2021-01-07 05:24:06,382 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:06,383 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,392 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,393 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,393 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-01-07 05:24:06,596 INFO L348 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-01-07 05:24:06,596 INFO L382 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:24:06,597 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,617 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,618 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,618 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2021-01-07 05:24:06,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:06,723 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,724 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 38 [2021-01-07 05:24:06,725 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,746 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,748 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:30 [2021-01-07 05:24:06,802 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_58|], 6=[|v_#memory_$Pointer$.offset_48|]} [2021-01-07 05:24:06,807 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:06,809 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,830 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,859 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:06,860 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2021-01-07 05:24:06,862 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,900 INFO L625 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2021-01-07 05:24:06,901 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:06,901 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:25 [2021-01-07 05:24:07,170 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2021-01-07 05:24:07,172 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:07,192 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:07,193 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:07,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:42 [2021-01-07 05:24:07,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:07,462 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:07,463 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39 [2021-01-07 05:24:07,464 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:07,476 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:07,477 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:07,478 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2021-01-07 05:24:07,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:07,575 INFO L382 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 22 treesize of output 10 [2021-01-07 05:24:07,577 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:07,582 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:07,584 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:07,584 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2021-01-07 05:24:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:07,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:07,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2021-01-07 05:24:07,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99958105] [2021-01-07 05:24:07,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-01-07 05:24:07,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-01-07 05:24:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2021-01-07 05:24:07,610 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 29 states. [2021-01-07 05:24:09,541 WARN L197 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2021-01-07 05:24:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:10,282 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2021-01-07 05:24:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-01-07 05:24:10,283 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 50 [2021-01-07 05:24:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:10,284 INFO L225 Difference]: With dead ends: 75 [2021-01-07 05:24:10,284 INFO L226 Difference]: Without dead ends: 75 [2021-01-07 05:24:10,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=481, Invalid=1969, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:24:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-07 05:24:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2021-01-07 05:24:10,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-01-07 05:24:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2021-01-07 05:24:10,288 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 50 [2021-01-07 05:24:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:10,288 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2021-01-07 05:24:10,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2021-01-07 05:24:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2021-01-07 05:24:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-07 05:24:10,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:10,288 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:10,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-01-07 05:24:10,489 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:24:10,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:10,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1390050804, now seen corresponding path program 1 times [2021-01-07 05:24:10,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:10,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189444742] [2021-01-07 05:24:10,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:10,881 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:10,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189444742] [2021-01-07 05:24:10,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757477975] [2021-01-07 05:24:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:11,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 55 conjunts are in the unsatisfiable core [2021-01-07 05:24:11,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:11,016 INFO L382 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-01-07 05:24:11,016 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,026 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,030 INFO L382 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-01-07 05:24:11,031 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,042 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,043 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,043 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2021-01-07 05:24:11,095 INFO L443 ElimStorePlain]: Different costs {0=[|v_#length_65|], 1=[|v_#valid_91|]} [2021-01-07 05:24:11,100 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:24:11,102 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,121 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:11,129 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:11,131 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,145 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,146 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,146 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2021-01-07 05:24:11,218 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:11,219 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,234 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,234 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2021-01-07 05:24:11,467 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,468 INFO L382 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 37 [2021-01-07 05:24:11,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:11,471 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,533 INFO L625 ElimStorePlain]: treesize reduction 21, result has 63.8 percent of original size [2021-01-07 05:24:11,534 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,535 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:34 [2021-01-07 05:24:11,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:11,645 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,646 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 36 [2021-01-07 05:24:11,647 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,695 INFO L625 ElimStorePlain]: treesize reduction 16, result has 70.4 percent of original size [2021-01-07 05:24:11,697 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2021-01-07 05:24:11,797 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:11,798 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2021-01-07 05:24:11,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:11,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:11,802 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,838 INFO L625 ElimStorePlain]: treesize reduction 12, result has 67.6 percent of original size [2021-01-07 05:24:11,841 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:11,842 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:26 [2021-01-07 05:24:12,176 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-01-07 05:24:12,177 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:12,182 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2021-01-07 05:24:12,183 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:12,232 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:12,233 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:24:12,233 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:91, output treesize:69 [2021-01-07 05:24:12,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:12,644 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:12,644 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 51 [2021-01-07 05:24:12,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:24:12,648 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:12,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:12,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:12,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:12,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:12,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:12,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:12,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:12,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:12,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:12,655 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:12,713 INFO L625 ElimStorePlain]: treesize reduction 33, result has 48.4 percent of original size [2021-01-07 05:24:12,714 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:12,715 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:28 [2021-01-07 05:24:12,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:12,865 INFO L382 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 26 treesize of output 10 [2021-01-07 05:24:12,866 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:12,876 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:12,879 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:12,879 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:3 [2021-01-07 05:24:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:12,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:12,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 29 [2021-01-07 05:24:12,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377670324] [2021-01-07 05:24:12,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-01-07 05:24:12,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-01-07 05:24:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-01-07 05:24:12,929 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 30 states. [2021-01-07 05:24:14,283 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2021-01-07 05:24:14,627 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2021-01-07 05:24:14,813 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2021-01-07 05:24:15,000 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2021-01-07 05:24:15,683 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 43 [2021-01-07 05:24:15,946 WARN L197 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2021-01-07 05:24:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:18,799 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2021-01-07 05:24:18,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-01-07 05:24:18,800 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 51 [2021-01-07 05:24:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:18,801 INFO L225 Difference]: With dead ends: 85 [2021-01-07 05:24:18,801 INFO L226 Difference]: Without dead ends: 85 [2021-01-07 05:24:18,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=450, Invalid=2202, Unknown=0, NotChecked=0, Total=2652 [2021-01-07 05:24:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2021-01-07 05:24:18,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2021-01-07 05:24:18,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-07 05:24:18,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2021-01-07 05:24:18,805 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 51 [2021-01-07 05:24:18,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:18,806 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2021-01-07 05:24:18,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2021-01-07 05:24:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2021-01-07 05:24:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-07 05:24:18,806 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:18,806 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:19,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:19,010 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:24:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 141902104, now seen corresponding path program 1 times [2021-01-07 05:24:19,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:19,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623045178] [2021-01-07 05:24:19,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-07 05:24:19,067 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623045178] [2021-01-07 05:24:19,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:19,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:19,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398723160] [2021-01-07 05:24:19,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:19,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:19,069 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 5 states. [2021-01-07 05:24:19,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:19,194 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2021-01-07 05:24:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:19,195 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2021-01-07 05:24:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:19,195 INFO L225 Difference]: With dead ends: 71 [2021-01-07 05:24:19,195 INFO L226 Difference]: Without dead ends: 71 [2021-01-07 05:24:19,196 INFO L677 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-01-07 05:24:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-01-07 05:24:19,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-01-07 05:24:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-01-07 05:24:19,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2021-01-07 05:24:19,198 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 52 [2021-01-07 05:24:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:19,198 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2021-01-07 05:24:19,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2021-01-07 05:24:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-01-07 05:24:19,199 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:19,199 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:19,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-07 05:24:19,199 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2021-01-07 05:24:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 346419682, now seen corresponding path program 1 times [2021-01-07 05:24:19,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:19,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189519915] [2021-01-07 05:24:19,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:20,113 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2021-01-07 05:24:20,448 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 52 [2021-01-07 05:24:20,633 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-07 05:24:20,813 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2021-01-07 05:24:21,004 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2021-01-07 05:24:21,193 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2021-01-07 05:24:21,396 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2021-01-07 05:24:21,616 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2021-01-07 05:24:21,808 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 42 [2021-01-07 05:24:22,067 WARN L197 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2021-01-07 05:24:22,285 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-01-07 05:24:22,506 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-01-07 05:24:22,789 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-01-07 05:24:23,041 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2021-01-07 05:24:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:24,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189519915] [2021-01-07 05:24:24,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911416403] [2021-01-07 05:24:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:24,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 117 conjunts are in the unsatisfiable core [2021-01-07 05:24:24,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:24,816 INFO L348 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-01-07 05:24:24,816 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2021-01-07 05:24:24,818 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:24,838 INFO L625 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2021-01-07 05:24:24,839 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:24,840 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2021-01-07 05:24:24,973 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-01-07 05:24:24,974 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:25,000 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:25,001 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:25,001 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:37 [2021-01-07 05:24:25,182 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2021-01-07 05:24:25,184 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:25,225 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:25,226 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:25,226 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:56 [2021-01-07 05:24:25,651 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-01-07 05:24:25,652 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:25,720 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:25,722 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:25,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:90, output treesize:101 [2021-01-07 05:24:25,950 INFO L443 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_50|], 2=[|v_#memory_$Pointer$.base_65|]} [2021-01-07 05:24:25,957 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-01-07 05:24:25,961 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:26,023 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:26,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:26,031 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 45 [2021-01-07 05:24:26,032 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:26,092 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:26,094 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:26,094 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:106, output treesize:123 [2021-01-07 05:24:26,637 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-01-07 05:24:27,114 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2021-01-07 05:24:27,123 INFO L443 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_51|], 12=[|v_#memory_$Pointer$.base_66|]} [2021-01-07 05:24:27,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:27,135 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2021-01-07 05:24:27,136 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,251 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2021-01-07 05:24:27,251 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:27,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:27,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:27,268 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:27,268 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 84 [2021-01-07 05:24:27,270 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,382 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2021-01-07 05:24:27,382 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:27,384 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:27,385 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:198, output treesize:190 [2021-01-07 05:24:27,700 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 05:24:27,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:27,742 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2021-01-07 05:24:27,749 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,880 WARN L197 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-01-07 05:24:27,881 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:27,882 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:27,883 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:204, output treesize:182 [2021-01-07 05:24:28,238 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-07 05:24:28,549 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-01-07 05:24:28,860 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-01-07 05:24:28,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:28,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:28,888 INFO L348 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-01-07 05:24:28,889 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 94 [2021-01-07 05:24:28,891 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:28,983 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:28,985 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:28,985 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:188, output treesize:164 [2021-01-07 05:24:29,295 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-01-07 05:24:29,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:29,323 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:29,323 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 105 [2021-01-07 05:24:29,326 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:29,409 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:29,410 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:29,411 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:169, output treesize:211 [2021-01-07 05:24:30,101 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-01-07 05:24:30,589 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2021-01-07 05:24:31,351 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-07 05:24:31,726 WARN L197 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-01-07 05:24:32,110 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 63 [2021-01-07 05:24:32,111 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:32,236 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-01-07 05:24:32,237 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:32,238 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:32,238 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:257, output treesize:242 [2021-01-07 05:24:32,611 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-01-07 05:24:33,027 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-01-07 05:24:33,500 WARN L197 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2021-01-07 05:24:33,557 INFO L348 Elim1Store]: treesize reduction 16, result has 60.0 percent of original size [2021-01-07 05:24:33,558 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 223 treesize of output 126 [2021-01-07 05:24:33,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:24:33,566 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:24:33,568 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:33,763 WARN L197 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2021-01-07 05:24:33,763 INFO L625 ElimStorePlain]: treesize reduction 12, result has 93.3 percent of original size [2021-01-07 05:24:33,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:33,776 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:248, output treesize:168 [2021-01-07 05:24:34,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:24:34,897 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:34,898 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 86 [2021-01-07 05:24:34,901 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:34,963 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:34,966 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-01-07 05:24:34,966 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:172, output treesize:95 [2021-01-07 05:24:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:36,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:36,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 61 [2021-01-07 05:24:36,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510348914] [2021-01-07 05:24:36,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 63 states [2021-01-07 05:24:36,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:36,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2021-01-07 05:24:36,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3643, Unknown=0, NotChecked=0, Total=3906 [2021-01-07 05:24:36,538 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 63 states.