/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/heap-manipulation/dancing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-07 05:24:20,451 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-07 05:24:20,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-07 05:24:20,520 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-07 05:24:20,520 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-07 05:24:20,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-07 05:24:20,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-07 05:24:20,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-07 05:24:20,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-07 05:24:20,546 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-07 05:24:20,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-07 05:24:20,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-07 05:24:20,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-07 05:24:20,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-07 05:24:20,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-07 05:24:20,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-07 05:24:20,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-07 05:24:20,566 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-07 05:24:20,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-07 05:24:20,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-07 05:24:20,585 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-07 05:24:20,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-07 05:24:20,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-07 05:24:20,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-07 05:24:20,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-07 05:24:20,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-07 05:24:20,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-07 05:24:20,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-07 05:24:20,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-07 05:24:20,607 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-07 05:24:20,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-07 05:24:20,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-07 05:24:20,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-07 05:24:20,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-07 05:24:20,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-07 05:24:20,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-07 05:24:20,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-07 05:24:20,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-07 05:24:20,623 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-07 05:24:20,624 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-07 05:24:20,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-07 05:24:20,630 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:24:20,699 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-07 05:24:20,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-07 05:24:20,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-07 05:24:20,704 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-07 05:24:20,704 INFO L138 SettingsManager]: * Use SBE=true [2021-01-07 05:24:20,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-07 05:24:20,705 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-01-07 05:24:20,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-07 05:24:20,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-07 05:24:20,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-01-07 05:24:20,709 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-01-07 05:24:20,709 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-01-07 05:24:20,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-07 05:24:20,710 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-01-07 05:24:20,710 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-07 05:24:20,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-07 05:24:20,710 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-07 05:24:20,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-07 05:24:20,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-07 05:24:20,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-07 05:24:20,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-07 05:24:20,711 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-07 05:24:20,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-07 05:24:20,712 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-07 05:24:20,712 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:24:21,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-07 05:24:21,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-07 05:24:21,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-07 05:24:21,159 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-07 05:24:21,160 INFO L275 PluginConnector]: CDTParser initialized [2021-01-07 05:24:21,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2021-01-07 05:24:21,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90f2001ac/8e1ee8ee55fa430bb8279a5ddbd43bfd/FLAG62eac13f4 [2021-01-07 05:24:22,002 INFO L306 CDTParser]: Found 1 translation units. [2021-01-07 05:24:22,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2021-01-07 05:24:22,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90f2001ac/8e1ee8ee55fa430bb8279a5ddbd43bfd/FLAG62eac13f4 [2021-01-07 05:24:22,300 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/90f2001ac/8e1ee8ee55fa430bb8279a5ddbd43bfd [2021-01-07 05:24:22,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-07 05:24:22,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-07 05:24:22,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-07 05:24:22,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-07 05:24:22,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-07 05:24:22,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:22,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4287865 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22, skipping insertion in model container [2021-01-07 05:24:22,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:22,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-07 05:24:22,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-07 05:24:22,629 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]]] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~list~0,],L] left hand side expression in assignment: lhs: StructLHS[VariableLHS[~list~0,],R] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tail~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~tail~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-07 05:24:22,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:24:22,855 INFO L203 MainTranslator]: Completed pre-run [2021-01-07 05:24:22,870 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i[938,951] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem6,],base],StructAccessExpression[IdentifierExpression[#t~mem6,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem9,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem9,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem12,],base],StructAccessExpression[IdentifierExpression[#t~mem12,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[#t~mem14,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[#t~mem14,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#list~0,],base],StructAccessExpression[IdentifierExpression[~#list~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#list~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~#list~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],StructAccessExpression[IdentifierExpression[~n~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~n~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~n~0,],offset]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~tail~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[8],StructAccessExpression[IdentifierExpression[~tail~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~x~0,] [2021-01-07 05:24:22,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-07 05:24:22,977 INFO L208 MainTranslator]: Completed translation [2021-01-07 05:24:22,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22 WrapperNode [2021-01-07 05:24:22,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-07 05:24:22,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-07 05:24:22,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-07 05:24:22,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-07 05:24:22,988 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:24:22" (1/1) ... [2021-01-07 05:24:23,007 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:24:22" (1/1) ... [2021-01-07 05:24:23,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-07 05:24:23,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-07 05:24:23,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-07 05:24:23,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-07 05:24:23,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (1/1) ... [2021-01-07 05:24:23,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-07 05:24:23,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-07 05:24:23,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-07 05:24:23,115 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-07 05:24:23,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (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:24:23,237 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2021-01-07 05:24:23,238 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2021-01-07 05:24:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-01-07 05:24:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-01-07 05:24:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-07 05:24:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-01-07 05:24:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-07 05:24:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-07 05:24:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-07 05:24:23,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-07 05:24:23,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-07 05:24:23,867 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-01-07 05:24:23,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:24:23 BoogieIcfgContainer [2021-01-07 05:24:23,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-07 05:24:23,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-07 05:24:23,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-07 05:24:23,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-07 05:24:23,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.01 05:24:22" (1/3) ... [2021-01-07 05:24:23,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6665060d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:24:23, skipping insertion in model container [2021-01-07 05:24:23,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.01 05:24:22" (2/3) ... [2021-01-07 05:24:23,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6665060d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 05:24:23, skipping insertion in model container [2021-01-07 05:24:23,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 05:24:23" (3/3) ... [2021-01-07 05:24:23,886 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2021-01-07 05:24:23,904 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-07 05:24:23,915 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2021-01-07 05:24:23,941 INFO L253 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2021-01-07 05:24:23,976 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-07 05:24:23,976 INFO L378 AbstractCegarLoop]: Hoare is false [2021-01-07 05:24:23,977 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-07 05:24:23,977 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-07 05:24:23,977 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-07 05:24:23,977 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-07 05:24:23,977 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-07 05:24:23,978 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-07 05:24:24,005 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2021-01-07 05:24:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:24:24,013 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:24,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:24:24,014 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:24,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-01-07 05:24:24,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:24,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448267852] [2021-01-07 05:24:24,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:24,321 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:24:24,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448267852] [2021-01-07 05:24:24,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:24,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:24,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285874781] [2021-01-07 05:24:24,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:24,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:24,373 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2021-01-07 05:24:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:24,601 INFO L93 Difference]: Finished difference Result 105 states and 117 transitions. [2021-01-07 05:24:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:24,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:24:24,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:24,624 INFO L225 Difference]: With dead ends: 105 [2021-01-07 05:24:24,625 INFO L226 Difference]: Without dead ends: 103 [2021-01-07 05:24:24,627 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:24:24,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-01-07 05:24:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-01-07 05:24:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2021-01-07 05:24:24,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2021-01-07 05:24:24,706 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 3 [2021-01-07 05:24:24,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:24,706 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2021-01-07 05:24:24,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2021-01-07 05:24:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-01-07 05:24:24,709 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:24,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-01-07 05:24:24,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-07 05:24:24,711 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-01-07 05:24:24,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:24,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663901579] [2021-01-07 05:24:24,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:24,854 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:24:24,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663901579] [2021-01-07 05:24:24,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:24,856 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:24,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675636222] [2021-01-07 05:24:24,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:24,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:24,863 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 3 states. [2021-01-07 05:24:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:25,024 INFO L93 Difference]: Finished difference Result 101 states and 113 transitions. [2021-01-07 05:24:25,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:25,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-01-07 05:24:25,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:25,027 INFO L225 Difference]: With dead ends: 101 [2021-01-07 05:24:25,028 INFO L226 Difference]: Without dead ends: 101 [2021-01-07 05:24:25,029 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:24:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2021-01-07 05:24:25,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2021-01-07 05:24:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-01-07 05:24:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2021-01-07 05:24:25,040 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 3 [2021-01-07 05:24:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:25,041 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2021-01-07 05:24:25,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2021-01-07 05:24:25,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:24:25,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:25,042 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:25,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-07 05:24:25,043 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:25,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:25,044 INFO L82 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2021-01-07 05:24:25,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:25,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183833980] [2021-01-07 05:24:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:25,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:25,110 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:24:25,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183833980] [2021-01-07 05:24:25,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:25,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:25,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928381535] [2021-01-07 05:24:25,113 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:25,113 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:25,115 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 3 states. [2021-01-07 05:24:25,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:25,322 INFO L93 Difference]: Finished difference Result 169 states and 190 transitions. [2021-01-07 05:24:25,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:25,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 05:24:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:25,332 INFO L225 Difference]: With dead ends: 169 [2021-01-07 05:24:25,333 INFO L226 Difference]: Without dead ends: 169 [2021-01-07 05:24:25,333 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:24:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-01-07 05:24:25,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 99. [2021-01-07 05:24:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2021-01-07 05:24:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-01-07 05:24:25,365 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 8 [2021-01-07 05:24:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:25,366 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-01-07 05:24:25,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-01-07 05:24:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-01-07 05:24:25,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:25,367 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:25,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-07 05:24:25,368 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:25,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:25,369 INFO L82 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2021-01-07 05:24:25,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:25,371 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830457991] [2021-01-07 05:24:25,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:25,476 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:24:25,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830457991] [2021-01-07 05:24:25,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:25,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-07 05:24:25,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314958096] [2021-01-07 05:24:25,478 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-07 05:24:25,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:25,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-07 05:24:25,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-07 05:24:25,479 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 3 states. [2021-01-07 05:24:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:25,621 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2021-01-07 05:24:25,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-07 05:24:25,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2021-01-07 05:24:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:25,624 INFO L225 Difference]: With dead ends: 169 [2021-01-07 05:24:25,624 INFO L226 Difference]: Without dead ends: 169 [2021-01-07 05:24:25,625 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:24:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-01-07 05:24:25,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2021-01-07 05:24:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2021-01-07 05:24:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2021-01-07 05:24:25,635 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 8 [2021-01-07 05:24:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:25,635 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2021-01-07 05:24:25,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-07 05:24:25,635 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2021-01-07 05:24:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:24:25,636 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:25,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:25,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-07 05:24:25,637 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1124495229, now seen corresponding path program 1 times [2021-01-07 05:24:25,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:25,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572996555] [2021-01-07 05:24:25,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:25,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:24:25,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572996555] [2021-01-07 05:24:25,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:25,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:25,714 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600374084] [2021-01-07 05:24:25,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:25,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:25,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:25,720 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 5 states. [2021-01-07 05:24:25,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:25,813 INFO L93 Difference]: Finished difference Result 180 states and 205 transitions. [2021-01-07 05:24:25,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:25,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-07 05:24:25,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:25,817 INFO L225 Difference]: With dead ends: 180 [2021-01-07 05:24:25,818 INFO L226 Difference]: Without dead ends: 180 [2021-01-07 05:24:25,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:25,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-01-07 05:24:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 141. [2021-01-07 05:24:25,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2021-01-07 05:24:25,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 194 transitions. [2021-01-07 05:24:25,854 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 194 transitions. Word has length 10 [2021-01-07 05:24:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:25,855 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 194 transitions. [2021-01-07 05:24:25,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 194 transitions. [2021-01-07 05:24:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:24:25,858 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:25,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:25,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-07 05:24:25,859 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:25,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:25,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2021-01-07 05:24:25,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:25,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905499275] [2021-01-07 05:24:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:25,961 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:24:25,962 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905499275] [2021-01-07 05:24:25,962 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:25,962 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:24:25,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875894262] [2021-01-07 05:24:25,963 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:24:25,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:24:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:24:25,964 INFO L87 Difference]: Start difference. First operand 141 states and 194 transitions. Second operand 4 states. [2021-01-07 05:24:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:26,064 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2021-01-07 05:24:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:24:26,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-01-07 05:24:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:26,066 INFO L225 Difference]: With dead ends: 140 [2021-01-07 05:24:26,066 INFO L226 Difference]: Without dead ends: 140 [2021-01-07 05:24:26,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:26,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-01-07 05:24:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2021-01-07 05:24:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-01-07 05:24:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2021-01-07 05:24:26,075 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2021-01-07 05:24:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:26,075 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2021-01-07 05:24:26,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:24:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2021-01-07 05:24:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-01-07 05:24:26,076 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:26,076 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:26,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-07 05:24:26,077 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1121620372, now seen corresponding path program 1 times [2021-01-07 05:24:26,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:26,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967873988] [2021-01-07 05:24:26,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,142 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:24:26,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967873988] [2021-01-07 05:24:26,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:26,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:26,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503724572] [2021-01-07 05:24:26,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:26,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:26,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:26,145 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand 5 states. [2021-01-07 05:24:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:26,252 INFO L93 Difference]: Finished difference Result 139 states and 190 transitions. [2021-01-07 05:24:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:24:26,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2021-01-07 05:24:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:26,254 INFO L225 Difference]: With dead ends: 139 [2021-01-07 05:24:26,254 INFO L226 Difference]: Without dead ends: 139 [2021-01-07 05:24:26,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:26,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2021-01-07 05:24:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2021-01-07 05:24:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2021-01-07 05:24:26,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 190 transitions. [2021-01-07 05:24:26,262 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 190 transitions. Word has length 10 [2021-01-07 05:24:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:26,262 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 190 transitions. [2021-01-07 05:24:26,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 190 transitions. [2021-01-07 05:24:26,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-07 05:24:26,263 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:26,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:26,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-07 05:24:26,264 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:26,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -676042672, now seen corresponding path program 1 times [2021-01-07 05:24:26,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:26,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348522064] [2021-01-07 05:24:26,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:26,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,325 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:24:26,325 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348522064] [2021-01-07 05:24:26,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:26,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:26,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736184407] [2021-01-07 05:24:26,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:24:26,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:26,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:24:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:26,328 INFO L87 Difference]: Start difference. First operand 139 states and 190 transitions. Second operand 6 states. [2021-01-07 05:24:26,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:26,572 INFO L93 Difference]: Finished difference Result 163 states and 185 transitions. [2021-01-07 05:24:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:26,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-01-07 05:24:26,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:26,575 INFO L225 Difference]: With dead ends: 163 [2021-01-07 05:24:26,575 INFO L226 Difference]: Without dead ends: 163 [2021-01-07 05:24:26,576 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:26,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-01-07 05:24:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2021-01-07 05:24:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-01-07 05:24:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2021-01-07 05:24:26,588 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 15 [2021-01-07 05:24:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:26,589 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2021-01-07 05:24:26,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:24:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2021-01-07 05:24:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-01-07 05:24:26,591 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:26,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:26,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-07 05:24:26,595 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:26,596 INFO L82 PathProgramCache]: Analyzing trace with hash -676042671, now seen corresponding path program 1 times [2021-01-07 05:24:26,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:26,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669628820] [2021-01-07 05:24:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:26,748 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:24:26,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669628820] [2021-01-07 05:24:26,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:26,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:26,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649834374] [2021-01-07 05:24:26,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:24:26,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:26,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:24:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:26,754 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 6 states. [2021-01-07 05:24:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:27,061 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2021-01-07 05:24:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:27,061 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-01-07 05:24:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:27,063 INFO L225 Difference]: With dead ends: 159 [2021-01-07 05:24:27,063 INFO L226 Difference]: Without dead ends: 159 [2021-01-07 05:24:27,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:24:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-01-07 05:24:27,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2021-01-07 05:24:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2021-01-07 05:24:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2021-01-07 05:24:27,070 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 15 [2021-01-07 05:24:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:27,070 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2021-01-07 05:24:27,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:24:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2021-01-07 05:24:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:24:27,071 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:27,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:27,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-07 05:24:27,072 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:27,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1007406096, now seen corresponding path program 1 times [2021-01-07 05:24:27,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:27,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218215309] [2021-01-07 05:24:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:27,173 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218215309] [2021-01-07 05:24:27,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566201370] [2021-01-07 05:24:27,174 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:24:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:27,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:24:27,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:27,346 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:27,350 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,358 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:27,361 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,361 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:24:27,462 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:27,462 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:24:27,466 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,493 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2021-01-07 05:24:27,496 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:27,497 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-01-07 05:24:27,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:27,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:27,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:27,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:24:27,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2021-01-07 05:24:27,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422076339] [2021-01-07 05:24:27,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-07 05:24:27,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-07 05:24:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:24:27,750 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand 9 states. [2021-01-07 05:24:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:28,405 INFO L93 Difference]: Finished difference Result 205 states and 257 transitions. [2021-01-07 05:24:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:24:28,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2021-01-07 05:24:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:28,411 INFO L225 Difference]: With dead ends: 205 [2021-01-07 05:24:28,411 INFO L226 Difference]: Without dead ends: 205 [2021-01-07 05:24:28,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:24:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-01-07 05:24:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 143. [2021-01-07 05:24:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-07 05:24:28,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2021-01-07 05:24:28,423 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 16 [2021-01-07 05:24:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:28,423 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2021-01-07 05:24:28,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-07 05:24:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2021-01-07 05:24:28,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-01-07 05:24:28,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:28,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:28,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-07 05:24:28,630 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:28,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:28,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1007406097, now seen corresponding path program 1 times [2021-01-07 05:24:28,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:28,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569601227] [2021-01-07 05:24:28,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:28,748 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569601227] [2021-01-07 05:24:28,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930214835] [2021-01-07 05:24:28,749 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:24:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:28,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:24:28,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:28,901 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:28,902 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:24:28,906 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:28,911 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:28,931 INFO L625 ElimStorePlain]: treesize reduction 14, result has 54.8 percent of original size [2021-01-07 05:24:28,934 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:28,935 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2021-01-07 05:24:29,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:29,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:29,086 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-07 05:24:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:29,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-07 05:24:29,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 12 [2021-01-07 05:24:29,119 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288648816] [2021-01-07 05:24:29,119 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-07 05:24:29,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:29,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-07 05:24:29,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2021-01-07 05:24:29,120 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand 10 states. [2021-01-07 05:24:29,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:29,944 INFO L93 Difference]: Finished difference Result 226 states and 261 transitions. [2021-01-07 05:24:29,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:24:29,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2021-01-07 05:24:29,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:29,947 INFO L225 Difference]: With dead ends: 226 [2021-01-07 05:24:29,947 INFO L226 Difference]: Without dead ends: 226 [2021-01-07 05:24:29,948 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:24:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-01-07 05:24:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 143. [2021-01-07 05:24:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2021-01-07 05:24:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 184 transitions. [2021-01-07 05:24:29,960 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 184 transitions. Word has length 16 [2021-01-07 05:24:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:29,961 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 184 transitions. [2021-01-07 05:24:29,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-07 05:24:29,965 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 184 transitions. [2021-01-07 05:24:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-07 05:24:29,968 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:29,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:30,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:30,184 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:30,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:30,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1682703596, now seen corresponding path program 1 times [2021-01-07 05:24:30,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:30,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170315149] [2021-01-07 05:24:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:30,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:30,354 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:24:30,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170315149] [2021-01-07 05:24:30,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:30,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:24:30,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546013018] [2021-01-07 05:24:30,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:24:30,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:30,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:24:30,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:30,357 INFO L87 Difference]: Start difference. First operand 143 states and 184 transitions. Second operand 8 states. [2021-01-07 05:24:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:30,647 INFO L93 Difference]: Finished difference Result 196 states and 245 transitions. [2021-01-07 05:24:30,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:24:30,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2021-01-07 05:24:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:30,652 INFO L225 Difference]: With dead ends: 196 [2021-01-07 05:24:30,652 INFO L226 Difference]: Without dead ends: 196 [2021-01-07 05:24:30,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:24:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-01-07 05:24:30,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 151. [2021-01-07 05:24:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2021-01-07 05:24:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 195 transitions. [2021-01-07 05:24:30,661 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 195 transitions. Word has length 19 [2021-01-07 05:24:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:30,661 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 195 transitions. [2021-01-07 05:24:30,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:24:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 195 transitions. [2021-01-07 05:24:30,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:24:30,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:30,663 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:24:30,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-07 05:24:30,663 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1814435946, now seen corresponding path program 1 times [2021-01-07 05:24:30,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:30,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685549347] [2021-01-07 05:24:30,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:30,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:30,764 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:24:30,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685549347] [2021-01-07 05:24:30,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:30,766 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:24:30,766 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61831872] [2021-01-07 05:24:30,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:24:30,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:30,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:24:30,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:24:30,768 INFO L87 Difference]: Start difference. First operand 151 states and 195 transitions. Second operand 7 states. [2021-01-07 05:24:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:30,982 INFO L93 Difference]: Finished difference Result 191 states and 239 transitions. [2021-01-07 05:24:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:24:30,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2021-01-07 05:24:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:30,984 INFO L225 Difference]: With dead ends: 191 [2021-01-07 05:24:30,985 INFO L226 Difference]: Without dead ends: 191 [2021-01-07 05:24:30,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-01-07 05:24:30,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-01-07 05:24:30,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 153. [2021-01-07 05:24:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2021-01-07 05:24:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 197 transitions. [2021-01-07 05:24:30,992 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 197 transitions. Word has length 21 [2021-01-07 05:24:30,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:30,992 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 197 transitions. [2021-01-07 05:24:30,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:24:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 197 transitions. [2021-01-07 05:24:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-01-07 05:24:30,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:30,994 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:24:30,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-07 05:24:30,994 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:30,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:30,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1300172899, now seen corresponding path program 1 times [2021-01-07 05:24:30,995 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:30,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346246937] [2021-01-07 05:24:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:31,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:24:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:31,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346246937] [2021-01-07 05:24:31,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057337097] [2021-01-07 05:24:31,053 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:24:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:31,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-07 05:24:31,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:31,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:31,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:31,280 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-01-07 05:24:31,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923745571] [2021-01-07 05:24:31,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-07 05:24:31,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:31,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-07 05:24:31,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2021-01-07 05:24:31,282 INFO L87 Difference]: Start difference. First operand 153 states and 197 transitions. Second operand 12 states. [2021-01-07 05:24:31,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:31,928 INFO L93 Difference]: Finished difference Result 225 states and 258 transitions. [2021-01-07 05:24:31,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:24:31,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2021-01-07 05:24:31,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:31,931 INFO L225 Difference]: With dead ends: 225 [2021-01-07 05:24:31,931 INFO L226 Difference]: Without dead ends: 223 [2021-01-07 05:24:31,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-01-07 05:24:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-01-07 05:24:31,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 153. [2021-01-07 05:24:31,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2021-01-07 05:24:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 196 transitions. [2021-01-07 05:24:31,939 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 196 transitions. Word has length 21 [2021-01-07 05:24:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:31,939 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 196 transitions. [2021-01-07 05:24:31,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-07 05:24:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 196 transitions. [2021-01-07 05:24:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-01-07 05:24:31,940 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:31,941 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:24:32,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-07 05:24:32,156 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:32,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:32,157 INFO L82 PathProgramCache]: Analyzing trace with hash -2104198502, now seen corresponding path program 1 times [2021-01-07 05:24:32,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:32,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140791934] [2021-01-07 05:24:32,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:32,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:32,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140791934] [2021-01-07 05:24:32,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627898820] [2021-01-07 05:24:32,319 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:24:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:32,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjunts are in the unsatisfiable core [2021-01-07 05:24:32,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:32,415 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:32,416 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:32,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:32,426 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:32,426 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-01-07 05:24:32,456 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:24:32,457 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:32,461 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:32,462 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:32,462 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2021-01-07 05:24:32,525 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 21 treesize of output 9 [2021-01-07 05:24:32,527 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:32,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:32,530 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:32,531 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2021-01-07 05:24:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:32,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:32,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2021-01-07 05:24:32,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286164806] [2021-01-07 05:24:32,588 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-01-07 05:24:32,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-01-07 05:24:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2021-01-07 05:24:32,589 INFO L87 Difference]: Start difference. First operand 153 states and 196 transitions. Second operand 19 states. [2021-01-07 05:24:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:34,827 INFO L93 Difference]: Finished difference Result 519 states and 650 transitions. [2021-01-07 05:24:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:24:34,828 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2021-01-07 05:24:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:34,832 INFO L225 Difference]: With dead ends: 519 [2021-01-07 05:24:34,832 INFO L226 Difference]: Without dead ends: 519 [2021-01-07 05:24:34,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2021-01-07 05:24:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-01-07 05:24:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 237. [2021-01-07 05:24:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2021-01-07 05:24:34,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2021-01-07 05:24:34,852 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 22 [2021-01-07 05:24:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:34,852 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2021-01-07 05:24:34,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2021-01-07 05:24:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2021-01-07 05:24:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:24:34,854 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:34,855 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:24:35,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:35,069 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:35,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:35,070 INFO L82 PathProgramCache]: Analyzing trace with hash 439738587, now seen corresponding path program 1 times [2021-01-07 05:24:35,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:35,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446539830] [2021-01-07 05:24:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:35,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,106 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:24:35,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446539830] [2021-01-07 05:24:35,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:35,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:35,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906666814] [2021-01-07 05:24:35,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:24:35,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:35,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:24:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:24:35,108 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand 4 states. [2021-01-07 05:24:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:35,134 INFO L93 Difference]: Finished difference Result 252 states and 340 transitions. [2021-01-07 05:24:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:24:35,135 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2021-01-07 05:24:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:35,137 INFO L225 Difference]: With dead ends: 252 [2021-01-07 05:24:35,137 INFO L226 Difference]: Without dead ends: 252 [2021-01-07 05:24:35,138 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:24:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-01-07 05:24:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 247. [2021-01-07 05:24:35,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2021-01-07 05:24:35,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 335 transitions. [2021-01-07 05:24:35,159 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 335 transitions. Word has length 23 [2021-01-07 05:24:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:35,162 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 335 transitions. [2021-01-07 05:24:35,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:24:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 335 transitions. [2021-01-07 05:24:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:24:35,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:35,163 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:24:35,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-07 05:24:35,163 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:35,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:35,165 INFO L82 PathProgramCache]: Analyzing trace with hash 387998185, now seen corresponding path program 1 times [2021-01-07 05:24:35,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:35,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185192943] [2021-01-07 05:24:35,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:24:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:35,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185192943] [2021-01-07 05:24:35,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:35,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:35,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893745084] [2021-01-07 05:24:35,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:35,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:35,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:35,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:35,243 INFO L87 Difference]: Start difference. First operand 247 states and 335 transitions. Second operand 5 states. [2021-01-07 05:24:35,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:35,546 INFO L93 Difference]: Finished difference Result 316 states and 392 transitions. [2021-01-07 05:24:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:24:35,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-07 05:24:35,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:35,554 INFO L225 Difference]: With dead ends: 316 [2021-01-07 05:24:35,554 INFO L226 Difference]: Without dead ends: 316 [2021-01-07 05:24:35,554 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:35,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2021-01-07 05:24:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 246. [2021-01-07 05:24:35,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2021-01-07 05:24:35,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 333 transitions. [2021-01-07 05:24:35,571 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 333 transitions. Word has length 23 [2021-01-07 05:24:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:35,572 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 333 transitions. [2021-01-07 05:24:35,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 333 transitions. [2021-01-07 05:24:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-01-07 05:24:35,573 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:35,573 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:24:35,573 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-07 05:24:35,573 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:35,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:35,574 INFO L82 PathProgramCache]: Analyzing trace with hash 387998186, now seen corresponding path program 1 times [2021-01-07 05:24:35,574 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:35,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377481430] [2021-01-07 05:24:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:24:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:35,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377481430] [2021-01-07 05:24:35,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:35,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:24:35,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987706314] [2021-01-07 05:24:35,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:24:35,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:35,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:24:35,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:24:35,651 INFO L87 Difference]: Start difference. First operand 246 states and 333 transitions. Second operand 5 states. [2021-01-07 05:24:36,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:36,000 INFO L93 Difference]: Finished difference Result 314 states and 385 transitions. [2021-01-07 05:24:36,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:24:36,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2021-01-07 05:24:36,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:36,006 INFO L225 Difference]: With dead ends: 314 [2021-01-07 05:24:36,006 INFO L226 Difference]: Without dead ends: 314 [2021-01-07 05:24:36,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:24:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2021-01-07 05:24:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 240. [2021-01-07 05:24:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2021-01-07 05:24:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 324 transitions. [2021-01-07 05:24:36,040 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 324 transitions. Word has length 23 [2021-01-07 05:24:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:36,040 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 324 transitions. [2021-01-07 05:24:36,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:24:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 324 transitions. [2021-01-07 05:24:36,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:24:36,042 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:36,042 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:24:36,042 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-07 05:24:36,043 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 746999412, now seen corresponding path program 1 times [2021-01-07 05:24:36,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:36,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609906684] [2021-01-07 05:24:36,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,153 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:24:36,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609906684] [2021-01-07 05:24:36,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:36,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:36,154 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659974010] [2021-01-07 05:24:36,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:24:36,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:24:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:36,157 INFO L87 Difference]: Start difference. First operand 240 states and 324 transitions. Second operand 6 states. [2021-01-07 05:24:36,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:36,422 INFO L93 Difference]: Finished difference Result 261 states and 325 transitions. [2021-01-07 05:24:36,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:36,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2021-01-07 05:24:36,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:36,424 INFO L225 Difference]: With dead ends: 261 [2021-01-07 05:24:36,424 INFO L226 Difference]: Without dead ends: 261 [2021-01-07 05:24:36,425 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-01-07 05:24:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-01-07 05:24:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2021-01-07 05:24:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2021-01-07 05:24:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 318 transitions. [2021-01-07 05:24:36,435 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 318 transitions. Word has length 24 [2021-01-07 05:24:36,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:36,438 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 318 transitions. [2021-01-07 05:24:36,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:24:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 318 transitions. [2021-01-07 05:24:36,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-01-07 05:24:36,440 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:36,441 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:24:36,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-07 05:24:36,441 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:36,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:36,442 INFO L82 PathProgramCache]: Analyzing trace with hash 746999411, now seen corresponding path program 1 times [2021-01-07 05:24:36,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:36,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704602914] [2021-01-07 05:24:36,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:36,517 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:24:36,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704602914] [2021-01-07 05:24:36,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:36,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:24:36,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60462567] [2021-01-07 05:24:36,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-07 05:24:36,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:36,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-07 05:24:36,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:24:36,520 INFO L87 Difference]: Start difference. First operand 240 states and 318 transitions. Second operand 6 states. [2021-01-07 05:24:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:36,721 INFO L93 Difference]: Finished difference Result 252 states and 313 transitions. [2021-01-07 05:24:36,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:24:36,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2021-01-07 05:24:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:36,723 INFO L225 Difference]: With dead ends: 252 [2021-01-07 05:24:36,723 INFO L226 Difference]: Without dead ends: 252 [2021-01-07 05:24:36,724 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:36,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2021-01-07 05:24:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 237. [2021-01-07 05:24:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2021-01-07 05:24:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 307 transitions. [2021-01-07 05:24:36,733 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 307 transitions. Word has length 24 [2021-01-07 05:24:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:36,733 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 307 transitions. [2021-01-07 05:24:36,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-07 05:24:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 307 transitions. [2021-01-07 05:24:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:24:36,734 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:36,734 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:24:36,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-07 05:24:36,735 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1457055843, now seen corresponding path program 1 times [2021-01-07 05:24:36,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:36,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541517162] [2021-01-07 05:24:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:37,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:24:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:37,270 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541517162] [2021-01-07 05:24:37,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952952270] [2021-01-07 05:24:37,271 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:24:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:37,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:24:37,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:37,423 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:37,424 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,430 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,433 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,434 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-01-07 05:24:37,496 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:24:37,497 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:37,505 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,509 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:37,509 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:18 [2021-01-07 05:24:37,761 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,762 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 21 treesize of output 21 [2021-01-07 05:24:37,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:37,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:37,766 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:37,776 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:37,779 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:37,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:37,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:37,783 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:37,784 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:21 [2021-01-07 05:24:37,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:37,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:37,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:37,824 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2021-01-07 05:24:37,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985266462] [2021-01-07 05:24:37,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-01-07 05:24:37,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:37,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-01-07 05:24:37,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-01-07 05:24:37,826 INFO L87 Difference]: Start difference. First operand 237 states and 307 transitions. Second operand 23 states. [2021-01-07 05:24:38,829 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2021-01-07 05:24:38,980 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2021-01-07 05:24:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:41,163 INFO L93 Difference]: Finished difference Result 430 states and 510 transitions. [2021-01-07 05:24:41,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-01-07 05:24:41,164 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 25 [2021-01-07 05:24:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:41,166 INFO L225 Difference]: With dead ends: 430 [2021-01-07 05:24:41,167 INFO L226 Difference]: Without dead ends: 430 [2021-01-07 05:24:41,167 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=319, Invalid=1087, Unknown=0, NotChecked=0, Total=1406 [2021-01-07 05:24:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-01-07 05:24:41,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 237. [2021-01-07 05:24:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2021-01-07 05:24:41,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 306 transitions. [2021-01-07 05:24:41,178 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 306 transitions. Word has length 25 [2021-01-07 05:24:41,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:41,178 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 306 transitions. [2021-01-07 05:24:41,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2021-01-07 05:24:41,178 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 306 transitions. [2021-01-07 05:24:41,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-01-07 05:24:41,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:41,179 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:24:41,393 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-01-07 05:24:41,394 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:41,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1457055844, now seen corresponding path program 1 times [2021-01-07 05:24:41,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:41,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247410722] [2021-01-07 05:24:41,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:41,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:24:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:41,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:41,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247410722] [2021-01-07 05:24:41,573 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048397889] [2021-01-07 05:24:41,574 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:24:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:41,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 27 conjunts are in the unsatisfiable core [2021-01-07 05:24:41,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:41,745 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:24:41,747 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:41,756 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:41,760 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:24:41,761 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:41,772 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:41,774 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:41,774 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2021-01-07 05:24:41,957 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 29 treesize of output 17 [2021-01-07 05:24:41,960 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:41,968 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:41,971 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 32 treesize of output 14 [2021-01-07 05:24:41,972 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:41,977 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:41,978 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:41,978 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:11 [2021-01-07 05:24:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:42,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:42,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2021-01-07 05:24:42,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032800981] [2021-01-07 05:24:42,005 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:24:42,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:24:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-01-07 05:24:42,008 INFO L87 Difference]: Start difference. First operand 237 states and 306 transitions. Second operand 17 states. [2021-01-07 05:24:43,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:43,267 INFO L93 Difference]: Finished difference Result 398 states and 474 transitions. [2021-01-07 05:24:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-07 05:24:43,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2021-01-07 05:24:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:43,273 INFO L225 Difference]: With dead ends: 398 [2021-01-07 05:24:43,273 INFO L226 Difference]: Without dead ends: 398 [2021-01-07 05:24:43,274 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:24:43,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-01-07 05:24:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 255. [2021-01-07 05:24:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2021-01-07 05:24:43,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 328 transitions. [2021-01-07 05:24:43,286 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 328 transitions. Word has length 25 [2021-01-07 05:24:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:43,287 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 328 transitions. [2021-01-07 05:24:43,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:24:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 328 transitions. [2021-01-07 05:24:43,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:24:43,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:43,288 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:24:43,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:24:43,502 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:43,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1633976965, now seen corresponding path program 1 times [2021-01-07 05:24:43,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:43,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057055237] [2021-01-07 05:24:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:43,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:24:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:43,636 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:24:43,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057055237] [2021-01-07 05:24:43,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:24:43,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-01-07 05:24:43,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836364607] [2021-01-07 05:24:43,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-01-07 05:24:43,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-01-07 05:24:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-01-07 05:24:43,638 INFO L87 Difference]: Start difference. First operand 255 states and 328 transitions. Second operand 8 states. [2021-01-07 05:24:43,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:24:43,880 INFO L93 Difference]: Finished difference Result 283 states and 359 transitions. [2021-01-07 05:24:43,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-01-07 05:24:43,881 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2021-01-07 05:24:43,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:24:43,882 INFO L225 Difference]: With dead ends: 283 [2021-01-07 05:24:43,883 INFO L226 Difference]: Without dead ends: 283 [2021-01-07 05:24:43,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:24:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2021-01-07 05:24:43,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 266. [2021-01-07 05:24:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2021-01-07 05:24:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 342 transitions. [2021-01-07 05:24:43,892 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 342 transitions. Word has length 27 [2021-01-07 05:24:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:24:43,893 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 342 transitions. [2021-01-07 05:24:43,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-01-07 05:24:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 342 transitions. [2021-01-07 05:24:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:24:43,894 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:24:43,894 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:24:43,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-07 05:24:43,894 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:24:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:24:43,895 INFO L82 PathProgramCache]: Analyzing trace with hash -353927123, now seen corresponding path program 1 times [2021-01-07 05:24:43,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:24:43,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001013084] [2021-01-07 05:24:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:24:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:43,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:24:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:43,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001013084] [2021-01-07 05:24:43,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871478907] [2021-01-07 05:24:43,997 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:24:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:24:44,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 46 conjunts are in the unsatisfiable core [2021-01-07 05:24:44,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:24:44,160 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:24:44,161 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:44,175 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:44,181 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:24:44,181 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:44,194 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:44,194 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:24:44,195 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2021-01-07 05:24:44,254 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:44,255 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 23 treesize of output 56 [2021-01-07 05:24:44,257 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:44,294 INFO L625 ElimStorePlain]: treesize reduction 26, result has 65.8 percent of original size [2021-01-07 05:24:44,317 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:44,317 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 23 treesize of output 56 [2021-01-07 05:24:44,319 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:24:44,365 INFO L625 ElimStorePlain]: treesize reduction 18, result has 75.0 percent of original size [2021-01-07 05:24:44,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:44,369 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:44,370 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:54 [2021-01-07 05:24:44,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:24:44,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:24:44,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2021-01-07 05:24:44,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:45,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 3, 1] term [2021-01-07 05:24:45,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:45,156 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 7 disjuncts [2021-01-07 05:24:45,455 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:45,455 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 94 [2021-01-07 05:24:45,458 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2021-01-07 05:24:45,460 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:24:45,463 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:45,484 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:45,491 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:24:45,492 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 66 treesize of output 39 [2021-01-07 05:24:45,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:45,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-07 05:24:45,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:24:45,500 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2021-01-07 05:24:45,525 INFO L625 ElimStorePlain]: treesize reduction 7, result has 73.1 percent of original size [2021-01-07 05:24:45,527 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-01-07 05:24:45,527 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:14 [2021-01-07 05:24:45,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:24:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:24:45,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:24:45,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 22 [2021-01-07 05:24:45,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226292447] [2021-01-07 05:24:45,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 05:24:45,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:24:45,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 05:24:45,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:24:45,596 INFO L87 Difference]: Start difference. First operand 266 states and 342 transitions. Second operand 22 states. [2021-01-07 05:24:53,975 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2021-01-07 05:24:58,583 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2021-01-07 05:25:00,888 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-01-07 05:25:01,228 WARN L197 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2021-01-07 05:25:03,734 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2021-01-07 05:25:06,044 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2021-01-07 05:25:06,295 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2021-01-07 05:25:06,562 WARN L197 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2021-01-07 05:25:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:25:11,755 INFO L93 Difference]: Finished difference Result 377 states and 449 transitions. [2021-01-07 05:25:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-01-07 05:25:11,755 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2021-01-07 05:25:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:25:11,758 INFO L225 Difference]: With dead ends: 377 [2021-01-07 05:25:11,758 INFO L226 Difference]: Without dead ends: 371 [2021-01-07 05:25:11,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=280, Invalid=1202, Unknown=0, NotChecked=0, Total=1482 [2021-01-07 05:25:11,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-01-07 05:25:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 273. [2021-01-07 05:25:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2021-01-07 05:25:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 347 transitions. [2021-01-07 05:25:11,769 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 347 transitions. Word has length 27 [2021-01-07 05:25:11,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:25:11,770 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 347 transitions. [2021-01-07 05:25:11,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 05:25:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 347 transitions. [2021-01-07 05:25:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-07 05:25:11,770 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:25:11,771 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:25:11,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:25:11,984 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:25:11,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:25:11,985 INFO L82 PathProgramCache]: Analyzing trace with hash 923786604, now seen corresponding path program 1 times [2021-01-07 05:25:11,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:25:11,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334792235] [2021-01-07 05:25:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:25:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:12,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334792235] [2021-01-07 05:25:12,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424447890] [2021-01-07 05:25:12,218 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:25:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:12,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 31 conjunts are in the unsatisfiable core [2021-01-07 05:25:12,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:25:12,409 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:25:12,410 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,426 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:25:12,426 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,436 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,437 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:25:12,438 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:29 [2021-01-07 05:25:12,549 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 29 treesize of output 17 [2021-01-07 05:25:12,550 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,562 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 32 treesize of output 14 [2021-01-07 05:25:12,563 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:12,570 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:12,571 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:25:12,572 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:11 [2021-01-07 05:25:12,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-07 05:25:12,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:25:12,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2021-01-07 05:25:12,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886839604] [2021-01-07 05:25:12,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-01-07 05:25:12,663 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:12,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-01-07 05:25:12,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2021-01-07 05:25:12,664 INFO L87 Difference]: Start difference. First operand 273 states and 347 transitions. Second operand 22 states. [2021-01-07 05:25:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:25:13,829 INFO L93 Difference]: Finished difference Result 323 states and 398 transitions. [2021-01-07 05:25:13,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-01-07 05:25:13,830 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2021-01-07 05:25:13,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:25:13,833 INFO L225 Difference]: With dead ends: 323 [2021-01-07 05:25:13,833 INFO L226 Difference]: Without dead ends: 323 [2021-01-07 05:25:13,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:25:13,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-01-07 05:25:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 273. [2021-01-07 05:25:13,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2021-01-07 05:25:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 345 transitions. [2021-01-07 05:25:13,843 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 345 transitions. Word has length 28 [2021-01-07 05:25:13,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:25:13,843 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 345 transitions. [2021-01-07 05:25:13,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2021-01-07 05:25:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 345 transitions. [2021-01-07 05:25:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-01-07 05:25:13,844 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:25:13,844 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:25:14,057 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-07 05:25:14,058 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:25:14,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:25:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash 427343141, now seen corresponding path program 1 times [2021-01-07 05:25:14,059 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:25:14,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735533694] [2021-01-07 05:25:14,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:25:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:14,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:25:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:14,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:14,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735533694] [2021-01-07 05:25:14,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523715634] [2021-01-07 05:25:14,440 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:25:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:25:14,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 24 conjunts are in the unsatisfiable core [2021-01-07 05:25:14,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:25:14,589 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:25:14,590 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:14,594 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:14,595 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:25:14,596 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:10 [2021-01-07 05:25:18,717 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 20 treesize of output 8 [2021-01-07 05:25:18,719 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:25:18,721 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:25:18,721 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:25:18,722 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2021-01-07 05:25:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:25:18,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:25:18,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2021-01-07 05:25:18,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358789034] [2021-01-07 05:25:18,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-07 05:25:18,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:25:18,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-07 05:25:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2021-01-07 05:25:18,751 INFO L87 Difference]: Start difference. First operand 273 states and 345 transitions. Second operand 17 states. [2021-01-07 05:25:41,752 WARN L197 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 53 [2021-01-07 05:26:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:28,657 INFO L93 Difference]: Finished difference Result 364 states and 426 transitions. [2021-01-07 05:26:28,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-07 05:26:28,658 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2021-01-07 05:26:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:28,661 INFO L225 Difference]: With dead ends: 364 [2021-01-07 05:26:28,661 INFO L226 Difference]: Without dead ends: 364 [2021-01-07 05:26:28,661 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=178, Invalid=575, Unknown=3, NotChecked=0, Total=756 [2021-01-07 05:26:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2021-01-07 05:26:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 257. [2021-01-07 05:26:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2021-01-07 05:26:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 321 transitions. [2021-01-07 05:26:28,671 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 321 transitions. Word has length 27 [2021-01-07 05:26:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:28,672 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 321 transitions. [2021-01-07 05:26:28,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-07 05:26:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 321 transitions. [2021-01-07 05:26:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:26:28,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:28,673 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:26:28,873 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-01-07 05:26:28,874 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:28,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1442511059, now seen corresponding path program 1 times [2021-01-07 05:26:28,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:28,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983996873] [2021-01-07 05:26:28,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:28,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:26:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:28,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-01-07 05:26:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 05:26:28,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983996873] [2021-01-07 05:26:28,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:26:28,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-07 05:26:28,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203799925] [2021-01-07 05:26:28,928 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:26:28,928 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:26:28,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:26:28,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:26:28,929 INFO L87 Difference]: Start difference. First operand 257 states and 321 transitions. Second operand 4 states. [2021-01-07 05:26:28,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:28,971 INFO L93 Difference]: Finished difference Result 259 states and 308 transitions. [2021-01-07 05:26:28,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-07 05:26:28,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2021-01-07 05:26:28,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:28,974 INFO L225 Difference]: With dead ends: 259 [2021-01-07 05:26:28,974 INFO L226 Difference]: Without dead ends: 259 [2021-01-07 05:26:28,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:26:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-01-07 05:26:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2021-01-07 05:26:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2021-01-07 05:26:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 300 transitions. [2021-01-07 05:26:28,982 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 300 transitions. Word has length 29 [2021-01-07 05:26:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:28,982 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 300 transitions. [2021-01-07 05:26:28,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:26:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 300 transitions. [2021-01-07 05:26:28,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-01-07 05:26:28,983 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:28,983 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] [2021-01-07 05:26:28,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-07 05:26:28,984 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:28,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:28,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1697542573, now seen corresponding path program 1 times [2021-01-07 05:26:28,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:28,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295161945] [2021-01-07 05:26:28,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:29,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:26:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:29,058 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:26:29,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295161945] [2021-01-07 05:26:29,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:26:29,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-01-07 05:26:29,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853288316] [2021-01-07 05:26:29,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-07 05:26:29,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:26:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-07 05:26:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-01-07 05:26:29,060 INFO L87 Difference]: Start difference. First operand 245 states and 300 transitions. Second operand 7 states. [2021-01-07 05:26:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:29,310 INFO L93 Difference]: Finished difference Result 281 states and 339 transitions. [2021-01-07 05:26:29,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-07 05:26:29,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2021-01-07 05:26:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:29,313 INFO L225 Difference]: With dead ends: 281 [2021-01-07 05:26:29,313 INFO L226 Difference]: Without dead ends: 281 [2021-01-07 05:26:29,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-01-07 05:26:29,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2021-01-07 05:26:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2021-01-07 05:26:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2021-01-07 05:26:29,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 319 transitions. [2021-01-07 05:26:29,321 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 319 transitions. Word has length 29 [2021-01-07 05:26:29,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:29,321 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 319 transitions. [2021-01-07 05:26:29,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-07 05:26:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 319 transitions. [2021-01-07 05:26:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-01-07 05:26:29,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:29,322 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] [2021-01-07 05:26:29,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-07 05:26:29,323 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 793451563, now seen corresponding path program 1 times [2021-01-07 05:26:29,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:29,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314983293] [2021-01-07 05:26:29,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:29,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:26:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:26:29,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314983293] [2021-01-07 05:26:29,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078289290] [2021-01-07 05:26:29,800 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:26:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:29,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 40 conjunts are in the unsatisfiable core [2021-01-07 05:26:29,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:26:29,940 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:26:29,941 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:29,950 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:29,954 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:26:29,954 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:29,962 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:29,963 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:29,964 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2021-01-07 05:26:30,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,004 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:26:30,005 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,022 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,029 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:26:30,032 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,047 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,049 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,050 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2021-01-07 05:26:30,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,238 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:26:30,240 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,268 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,280 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2021-01-07 05:26:30,282 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,308 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,309 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,310 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2021-01-07 05:26:30,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,397 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 0 case distinctions, treesize of input 37 treesize of output 42 [2021-01-07 05:26:30,399 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,439 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,458 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 0 case distinctions, treesize of input 37 treesize of output 42 [2021-01-07 05:26:30,460 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,493 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,498 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,498 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:87, output treesize:79 [2021-01-07 05:26:30,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,602 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2021-01-07 05:26:30,604 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,638 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:30,664 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,665 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 2 case distinctions, treesize of input 89 treesize of output 94 [2021-01-07 05:26:30,672 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:30,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:30,709 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 1 xjuncts. [2021-01-07 05:26:30,709 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:93 [2021-01-07 05:26:31,390 INFO L443 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_40|], 30=[|v_#memory_$Pointer$.base_43|]} [2021-01-07 05:26:31,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:31,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:31,502 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:31,504 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 5 case distinctions, treesize of input 111 treesize of output 281 [2021-01-07 05:26:31,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,516 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:26:31,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,519 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:26:31,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,532 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,540 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:26:31,541 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,543 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,545 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,546 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,549 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,553 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:26:31,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,562 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,565 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,568 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:26:31,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,570 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:31,581 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,582 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:26:31,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,593 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2021-01-07 05:26:31,594 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:26:31,603 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,609 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:26:31,610 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:26:31,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,613 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:31,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,618 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,620 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:26:31,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,631 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,636 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2021-01-07 05:26:31,637 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,641 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:31,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:31,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:26:31,649 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:26:31,825 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-01-07 05:26:31,826 INFO L625 ElimStorePlain]: treesize reduction 170, result has 46.7 percent of original size [2021-01-07 05:26:31,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:31,847 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:31,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,081 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2021-01-07 05:26:32,082 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:32,082 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 110 treesize of output 327 [2021-01-07 05:26:32,099 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:32,253 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2021-01-07 05:26:32,254 INFO L625 ElimStorePlain]: treesize reduction 37, result has 76.0 percent of original size [2021-01-07 05:26:32,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-07 05:26:32,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:26:32,258 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-07 05:26:32,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:26:32,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-07 05:26:32,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:26:32,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:32,262 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2021-01-07 05:26:32,262 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2021-01-07 05:26:32,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:32,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:32,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:32,270 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-01-07 05:26:32,270 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:162, output treesize:216 [2021-01-07 05:26:32,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:32,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-07 05:26:32,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:32,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:26:32,473 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:26:32,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:32,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:26:32,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-07 05:26:32,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:32,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2021-01-07 05:26:32,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-07 05:26:32,509 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:32,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,513 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:32,534 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:32,535 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 63 [2021-01-07 05:26:32,537 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:26:32,539 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:26:32,547 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:32,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,571 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:32,572 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 67 [2021-01-07 05:26:32,574 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-07 05:26:32,576 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:26:32,629 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:32,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:32,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,644 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:32,647 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2021-01-07 05:26:32,650 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:32,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,659 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:32,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:32,662 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 15 [2021-01-07 05:26:32,664 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:32,696 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:32,700 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:32,701 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:173, output treesize:7 [2021-01-07 05:26:32,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:26:32,714 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:26:32,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 25 [2021-01-07 05:26:32,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138093191] [2021-01-07 05:26:32,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-01-07 05:26:32,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:26:32,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-01-07 05:26:32,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2021-01-07 05:26:32,716 INFO L87 Difference]: Start difference. First operand 260 states and 319 transitions. Second operand 25 states. [2021-01-07 05:26:33,262 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2021-01-07 05:26:33,512 WARN L197 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 50 [2021-01-07 05:26:37,759 WARN L197 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 55 [2021-01-07 05:26:40,369 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2021-01-07 05:26:40,817 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2021-01-07 05:26:43,146 WARN L197 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 128 DAG size of output: 71 [2021-01-07 05:26:43,401 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 76 [2021-01-07 05:26:43,704 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2021-01-07 05:26:44,426 WARN L197 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2021-01-07 05:26:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:45,822 INFO L93 Difference]: Finished difference Result 416 states and 483 transitions. [2021-01-07 05:26:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-01-07 05:26:45,823 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 31 [2021-01-07 05:26:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:45,826 INFO L225 Difference]: With dead ends: 416 [2021-01-07 05:26:45,826 INFO L226 Difference]: Without dead ends: 416 [2021-01-07 05:26:45,828 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=396, Invalid=1858, Unknown=2, NotChecked=0, Total=2256 [2021-01-07 05:26:45,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-01-07 05:26:45,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 249. [2021-01-07 05:26:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2021-01-07 05:26:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 304 transitions. [2021-01-07 05:26:45,837 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 304 transitions. Word has length 31 [2021-01-07 05:26:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:45,837 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 304 transitions. [2021-01-07 05:26:45,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-01-07 05:26:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 304 transitions. [2021-01-07 05:26:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-01-07 05:26:45,838 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:45,838 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:26:46,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2021-01-07 05:26:46,053 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:46,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1113512885, now seen corresponding path program 1 times [2021-01-07 05:26:46,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:46,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468359559] [2021-01-07 05:26:46,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-07 05:26:46,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468359559] [2021-01-07 05:26:46,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922213909] [2021-01-07 05:26:46,503 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:26:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:46,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 39 conjunts are in the unsatisfiable core [2021-01-07 05:26:46,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:26:46,738 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:26:46,739 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:46,752 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:46,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 13 treesize of output 9 [2021-01-07 05:26:46,758 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:46,770 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:46,771 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:46,771 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2021-01-07 05:26:46,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:46,826 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 23 treesize of output 22 [2021-01-07 05:26:46,827 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:46,841 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:46,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:46,847 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 23 treesize of output 22 [2021-01-07 05:26:46,848 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:46,860 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:46,862 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:26:46,862 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:54 [2021-01-07 05:26:47,361 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:47,362 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 67 [2021-01-07 05:26:47,364 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-07 05:26:47,367 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:26:47,375 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:47,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:47,382 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2021-01-07 05:26:47,384 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:47,391 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:47,393 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:26:47,394 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:96, output treesize:7 [2021-01-07 05:26:47,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:26:47,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:26:47,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2021-01-07 05:26:47,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829592563] [2021-01-07 05:26:47,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 27 states [2021-01-07 05:26:47,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:26:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-01-07 05:26:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2021-01-07 05:26:47,455 INFO L87 Difference]: Start difference. First operand 249 states and 304 transitions. Second operand 27 states. [2021-01-07 05:26:49,219 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2021-01-07 05:26:50,475 WARN L197 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2021-01-07 05:26:52,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:52,753 INFO L93 Difference]: Finished difference Result 336 states and 383 transitions. [2021-01-07 05:26:52,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-01-07 05:26:52,754 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2021-01-07 05:26:52,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:52,756 INFO L225 Difference]: With dead ends: 336 [2021-01-07 05:26:52,757 INFO L226 Difference]: Without dead ends: 336 [2021-01-07 05:26:52,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=349, Invalid=2101, Unknown=0, NotChecked=0, Total=2450 [2021-01-07 05:26:52,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2021-01-07 05:26:52,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 237. [2021-01-07 05:26:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2021-01-07 05:26:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 285 transitions. [2021-01-07 05:26:52,766 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 285 transitions. Word has length 34 [2021-01-07 05:26:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:52,766 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 285 transitions. [2021-01-07 05:26:52,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2021-01-07 05:26:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 285 transitions. [2021-01-07 05:26:52,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-01-07 05:26:52,767 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:52,767 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:26:52,980 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-07 05:26:52,980 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:52,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1295726731, now seen corresponding path program 1 times [2021-01-07 05:26:52,982 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:52,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365048420] [2021-01-07 05:26:52,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:26:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-07 05:26:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-01-07 05:26:53,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365048420] [2021-01-07 05:26:53,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:26:53,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-07 05:26:53,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572363641] [2021-01-07 05:26:53,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-07 05:26:53,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:26:53,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-07 05:26:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-07 05:26:53,060 INFO L87 Difference]: Start difference. First operand 237 states and 285 transitions. Second operand 5 states. [2021-01-07 05:26:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:53,092 INFO L93 Difference]: Finished difference Result 246 states and 294 transitions. [2021-01-07 05:26:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-07 05:26:53,093 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2021-01-07 05:26:53,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:53,094 INFO L225 Difference]: With dead ends: 246 [2021-01-07 05:26:53,094 INFO L226 Difference]: Without dead ends: 246 [2021-01-07 05:26:53,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-01-07 05:26:53,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-01-07 05:26:53,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 239. [2021-01-07 05:26:53,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2021-01-07 05:26:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 287 transitions. [2021-01-07 05:26:53,102 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 287 transitions. Word has length 35 [2021-01-07 05:26:53,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:53,102 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 287 transitions. [2021-01-07 05:26:53,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-07 05:26:53,102 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 287 transitions. [2021-01-07 05:26:53,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:26:53,103 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:53,103 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:26:53,104 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-07 05:26:53,104 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:53,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:53,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1512828144, now seen corresponding path program 1 times [2021-01-07 05:26:53,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:53,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020709304] [2021-01-07 05:26:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-01-07 05:26:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-01-07 05:26:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-07 05:26:53,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020709304] [2021-01-07 05:26:53,152 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-07 05:26:53,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-07 05:26:53,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24340433] [2021-01-07 05:26:53,153 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-07 05:26:53,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:26:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-07 05:26:53,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-07 05:26:53,154 INFO L87 Difference]: Start difference. First operand 239 states and 287 transitions. Second operand 4 states. [2021-01-07 05:26:53,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-07 05:26:53,259 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2021-01-07 05:26:53,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-07 05:26:53,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2021-01-07 05:26:53,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-07 05:26:53,262 INFO L225 Difference]: With dead ends: 244 [2021-01-07 05:26:53,262 INFO L226 Difference]: Without dead ends: 222 [2021-01-07 05:26:53,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:26:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-01-07 05:26:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 217. [2021-01-07 05:26:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2021-01-07 05:26:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 263 transitions. [2021-01-07 05:26:53,269 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 263 transitions. Word has length 36 [2021-01-07 05:26:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-07 05:26:53,269 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 263 transitions. [2021-01-07 05:26:53,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-07 05:26:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 263 transitions. [2021-01-07 05:26:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-01-07 05:26:53,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-07 05:26:53,270 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-07 05:26:53,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-07 05:26:53,270 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr36REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, is_list_containing_xErr2REQUIRES_VIOLATION, is_list_containing_xErr3REQUIRES_VIOLATION, is_list_containing_xErr0REQUIRES_VIOLATION, is_list_containing_xErr1REQUIRES_VIOLATION]=== [2021-01-07 05:26:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-07 05:26:53,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1874362859, now seen corresponding path program 1 times [2021-01-07 05:26:53,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-07 05:26:53,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907409046] [2021-01-07 05:26:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-07 05:26:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-01-07 05:26:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-01-07 05:26:53,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:26:53,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907409046] [2021-01-07 05:26:53,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645770161] [2021-01-07 05:26:53,490 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:26:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-07 05:26:53,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 70 conjunts are in the unsatisfiable core [2021-01-07 05:26:53,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-07 05:26:53,590 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:26:53,591 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:53,597 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,597 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-01-07 05:26:53,667 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:53,668 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:26:53,669 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,700 INFO L625 ElimStorePlain]: treesize reduction 14, result has 62.2 percent of original size [2021-01-07 05:26:53,701 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,701 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2021-01-07 05:26:53,747 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:26:53,748 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,769 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:53,774 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:26:53,775 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,795 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:53,796 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,796 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2021-01-07 05:26:53,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:53,856 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:26:53,857 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:53,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:53,891 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:26:53,892 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,916 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:53,917 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:53,917 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:58 [2021-01-07 05:26:53,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:54,035 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:54,036 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 130 [2021-01-07 05:26:54,038 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:54,116 INFO L625 ElimStorePlain]: treesize reduction 70, result has 55.1 percent of original size [2021-01-07 05:26:54,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:26:54,123 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:26:54,137 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:26:54,138 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 62 [2021-01-07 05:26:54,143 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-07 05:26:54,213 INFO L625 ElimStorePlain]: treesize reduction 14, result has 84.1 percent of original size [2021-01-07 05:26:54,214 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-07 05:26:54,214 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:74 [2021-01-07 05:26:54,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2021-01-07 05:27:02,629 WARN L197 SmtUtils]: Spent 8.07 s on a formula simplification that was a NOOP. DAG size: 68 [2021-01-07 05:27:02,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2021-01-07 05:27:02,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:16,831 WARN L197 SmtUtils]: Spent 14.12 s on a formula simplification that was a NOOP. DAG size: 72 [2021-01-07 05:27:17,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 5, 1] term [2021-01-07 05:27:17,067 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-01-07 05:27:23,288 WARN L197 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 120 [2021-01-07 05:27:27,558 WARN L197 SmtUtils]: Spent 4.05 s on a formula simplification that was a NOOP. DAG size: 62 [2021-01-07 05:27:31,677 WARN L197 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 59 [2021-01-07 05:27:31,702 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 4, 4, 1] term [2021-01-07 05:27:31,702 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-07 05:27:36,219 WARN L197 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 262 DAG size of output: 117 [2021-01-07 05:27:36,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2021-01-07 05:27:36,265 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 10 disjuncts [2021-01-07 05:27:36,592 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 37 [2021-01-07 05:27:36,755 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:36,755 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 3 case distinctions, treesize of input 93 treesize of output 75 [2021-01-07 05:27:36,760 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-07 05:27:36,787 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:36,789 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:27:36,790 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:129, output treesize:70 [2021-01-07 05:27:36,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:36,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-07 05:27:36,989 INFO L173 IndexEqualityManager]: detected equality via solver [2021-01-07 05:27:36,994 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:36,995 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 34 [2021-01-07 05:27:36,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-07 05:27:36,998 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:27:37,013 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-07 05:27:37,015 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:27:37,015 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:19 [2021-01-07 05:27:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-07 05:27:37,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-07 05:27:37,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 32 [2021-01-07 05:27:37,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015304337] [2021-01-07 05:27:37,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-01-07 05:27:37,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-07 05:27:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-01-07 05:27:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2021-01-07 05:27:37,104 INFO L87 Difference]: Start difference. First operand 217 states and 263 transitions. Second operand 33 states. [2021-01-07 05:27:37,926 WARN L197 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2021-01-07 05:27:38,126 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2021-01-07 05:27:56,582 WARN L197 SmtUtils]: Spent 18.19 s on a formula simplification. DAG size of input: 97 DAG size of output: 70 [2021-01-07 05:28:19,077 WARN L197 SmtUtils]: Spent 20.25 s on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2021-01-07 05:28:19,432 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2021-01-07 05:28:23,915 WARN L197 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 167 DAG size of output: 78 [2021-01-07 05:28:24,088 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2021-01-07 05:28:46,495 WARN L197 SmtUtils]: Spent 20.24 s on a formula simplification. DAG size of input: 78 DAG size of output: 74