/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-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/reducercommutativity/sep10-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 10:15:26,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 10:15:26,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 10:15:26,530 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 10:15:26,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 10:15:26,536 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 10:15:26,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 10:15:26,543 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 10:15:26,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 10:15:26,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 10:15:26,566 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 10:15:26,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 10:15:26,568 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 10:15:26,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 10:15:26,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 10:15:26,576 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 10:15:26,577 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 10:15:26,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 10:15:26,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 10:15:26,594 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 10:15:26,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 10:15:26,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 10:15:26,599 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 10:15:26,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 10:15:26,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 10:15:26,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 10:15:26,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 10:15:26,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 10:15:26,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 10:15:26,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 10:15:26,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 10:15:26,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 10:15:26,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 10:15:26,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 10:15:26,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 10:15:26,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 10:15:26,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 10:15:26,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 10:15:26,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 10:15:26,629 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 10:15:26,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 10:15:26,633 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 10:15:26,659 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 10:15:26,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 10:15:26,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 10:15:26,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 10:15:26,661 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 10:15:26,661 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 10:15:26,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 10:15:26,662 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 10:15:26,662 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 10:15:26,662 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 10:15:26,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 10:15:26,663 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 10:15:26,663 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 10:15:26,663 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 10:15:26,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 10:15:26,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 10:15:26,664 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 10:15:26,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 10:15:26,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 10:15:26,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 10:15:26,665 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 10:15:26,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 10:15:26,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 10:15:26,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 10:15:26,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 10:15:26,665 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-06 10:15:26,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 10:15:27,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 10:15:27,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 10:15:27,032 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 10:15:27,033 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 10:15:27,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sep10-2.i [2021-01-06 10:15:27,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e99280f5/7be0f1e6c3574500a0b0984d6d0e22be/FLAGf28bb5335 [2021-01-06 10:15:27,827 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 10:15:27,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sep10-2.i [2021-01-06 10:15:27,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e99280f5/7be0f1e6c3574500a0b0984d6d0e22be/FLAGf28bb5335 [2021-01-06 10:15:27,859 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/3e99280f5/7be0f1e6c3574500a0b0984d6d0e22be [2021-01-06 10:15:27,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 10:15:27,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 10:15:27,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 10:15:27,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 10:15:27,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 10:15:27,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:15:27" (1/1) ... [2021-01-06 10:15:27,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3454b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:27, skipping insertion in model container [2021-01-06 10:15:27,881 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 10:15:27" (1/1) ... [2021-01-06 10:15:27,889 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 10:15:27,908 INFO L178 MainTranslator]: Built tables and reachable declarations left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~1,]]] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[0]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[1]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IdentifierExpression[~i~2,]]] left hand side expression in assignment: lhs: ArrayLHS[VariableLHS[~x~0,],[IntegerLiteral[9]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2021-01-06 10:15:28,108 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/reducercommutativity/sep10-2.i[1293,1306] [2021-01-06 10:15:28,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:15:28,123 INFO L203 MainTranslator]: Completed pre-run left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~1,]]]]] left hand side expression in assignment: lhs: VariableLHS[~ret~1,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[4],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret2~0,] left hand side expression in assignment: lhs: VariableLHS[~temp~0,] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,StructAccessExpression[IdentifierExpression[~#x~0,],offset],BinaryExpression[ARITHMUL,IntegerLiteral[4],IdentifierExpression[~i~2,]]]]] left hand side expression in assignment: address: StructConstructor[[base,offset],[StructAccessExpression[IdentifierExpression[~#x~0,],base],BinaryExpression[ARITHPLUS,IntegerLiteral[36],StructAccessExpression[IdentifierExpression[~#x~0,],offset]]]] left hand side expression in assignment: lhs: VariableLHS[~ret5~0,] [2021-01-06 10:15:28,145 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/reducercommutativity/sep10-2.i[1293,1306] [2021-01-06 10:15:28,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 10:15:28,162 INFO L208 MainTranslator]: Completed translation [2021-01-06 10:15:28,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28 WrapperNode [2021-01-06 10:15:28,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 10:15:28,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 10:15:28,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 10:15:28,166 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 10:15:28,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 10:15:28,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 10:15:28,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 10:15:28,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 10:15:28,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,231 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,236 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (1/1) ... [2021-01-06 10:15:28,241 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 10:15:28,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 10:15:28,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 10:15:28,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 10:15:28,243 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (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-06 10:15:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 10:15:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 10:15:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-01-06 10:15:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 10:15:28,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 10:15:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-01-06 10:15:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-01-06 10:15:28,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 10:15:28,861 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-01-06 10:15:28,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:15:28 BoogieIcfgContainer [2021-01-06 10:15:28,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 10:15:28,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 10:15:28,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 10:15:28,871 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 10:15:28,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 10:15:27" (1/3) ... [2021-01-06 10:15:28,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175fb465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:15:28, skipping insertion in model container [2021-01-06 10:15:28,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 10:15:28" (2/3) ... [2021-01-06 10:15:28,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175fb465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 10:15:28, skipping insertion in model container [2021-01-06 10:15:28,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 10:15:28" (3/3) ... [2021-01-06 10:15:28,878 INFO L111 eAbstractionObserver]: Analyzing ICFG sep10-2.i [2021-01-06 10:15:28,907 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 10:15:28,915 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 10:15:28,936 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 10:15:28,984 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 10:15:28,986 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 10:15:28,986 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 10:15:28,986 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 10:15:28,986 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 10:15:28,986 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 10:15:28,987 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 10:15:28,987 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 10:15:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2021-01-06 10:15:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 10:15:29,015 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:29,016 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:29,016 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:29,023 INFO L82 PathProgramCache]: Analyzing trace with hash -23080620, now seen corresponding path program 1 times [2021-01-06 10:15:29,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:29,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246914624] [2021-01-06 10:15:29,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:29,224 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-06 10:15:29,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246914624] [2021-01-06 10:15:29,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:15:29,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 10:15:29,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271460549] [2021-01-06 10:15:29,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-01-06 10:15:29,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:29,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-01-06 10:15:29,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 10:15:29,245 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2021-01-06 10:15:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:29,262 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2021-01-06 10:15:29,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-01-06 10:15:29,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2021-01-06 10:15:29,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:29,273 INFO L225 Difference]: With dead ends: 56 [2021-01-06 10:15:29,273 INFO L226 Difference]: Without dead ends: 26 [2021-01-06 10:15:29,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-01-06 10:15:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-01-06 10:15:29,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-01-06 10:15:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-01-06 10:15:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-01-06 10:15:29,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2021-01-06 10:15:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:29,327 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-01-06 10:15:29,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2021-01-06 10:15:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-01-06 10:15:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-01-06 10:15:29,328 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:29,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:29,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 10:15:29,329 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1060874985, now seen corresponding path program 1 times [2021-01-06 10:15:29,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:29,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231460001] [2021-01-06 10:15:29,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:29,389 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-06 10:15:29,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231460001] [2021-01-06 10:15:29,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 10:15:29,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 10:15:29,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902582178] [2021-01-06 10:15:29,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:15:29,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:15:29,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:15:29,393 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 3 states. [2021-01-06 10:15:29,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:29,418 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2021-01-06 10:15:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:15:29,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-01-06 10:15:29,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:29,421 INFO L225 Difference]: With dead ends: 50 [2021-01-06 10:15:29,421 INFO L226 Difference]: Without dead ends: 28 [2021-01-06 10:15:29,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 10:15:29,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-01-06 10:15:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-01-06 10:15:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2021-01-06 10:15:29,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2021-01-06 10:15:29,435 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2021-01-06 10:15:29,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:29,436 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2021-01-06 10:15:29,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:15:29,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2021-01-06 10:15:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-01-06 10:15:29,439 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:29,439 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-06 10:15:29,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 10:15:29,440 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:29,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash -507200985, now seen corresponding path program 1 times [2021-01-06 10:15:29,441 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:29,441 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925868362] [2021-01-06 10:15:29,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:29,531 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-06 10:15:29,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925868362] [2021-01-06 10:15:29,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818480735] [2021-01-06 10:15:29,532 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-06 10:15:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:29,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 10:15:29,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-01-06 10:15:29,672 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:15:29,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 10:15:29,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771589919] [2021-01-06 10:15:29,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:15:29,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:29,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:15:29,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:29,675 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 3 states. [2021-01-06 10:15:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:29,710 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2021-01-06 10:15:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:15:29,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2021-01-06 10:15:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:29,711 INFO L225 Difference]: With dead ends: 54 [2021-01-06 10:15:29,712 INFO L226 Difference]: Without dead ends: 36 [2021-01-06 10:15:29,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-01-06 10:15:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2021-01-06 10:15:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2021-01-06 10:15:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2021-01-06 10:15:29,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2021-01-06 10:15:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:29,719 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2021-01-06 10:15:29,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:15:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2021-01-06 10:15:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-01-06 10:15:29,720 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:29,720 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:29,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-01-06 10:15:29,935 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:29,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1833868074, now seen corresponding path program 1 times [2021-01-06 10:15:29,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:29,938 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429170423] [2021-01-06 10:15:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:29,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-01-06 10:15:29,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429170423] [2021-01-06 10:15:29,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490555127] [2021-01-06 10:15:29,981 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-06 10:15:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:30,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2021-01-06 10:15:30,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:30,094 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-06 10:15:30,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-01-06 10:15:30,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2021-01-06 10:15:30,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059469565] [2021-01-06 10:15:30,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 10:15:30,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:30,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 10:15:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:30,097 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 3 states. [2021-01-06 10:15:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:30,111 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2021-01-06 10:15:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 10:15:30,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2021-01-06 10:15:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:30,113 INFO L225 Difference]: With dead ends: 42 [2021-01-06 10:15:30,113 INFO L226 Difference]: Without dead ends: 32 [2021-01-06 10:15:30,114 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-01-06 10:15:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2021-01-06 10:15:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-01-06 10:15:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2021-01-06 10:15:30,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 28 [2021-01-06 10:15:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:30,120 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2021-01-06 10:15:30,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 10:15:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2021-01-06 10:15:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-01-06 10:15:30,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:30,122 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] [2021-01-06 10:15:30,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:30,337 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:30,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:30,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1777663060, now seen corresponding path program 1 times [2021-01-06 10:15:30,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:30,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434364411] [2021-01-06 10:15:30,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:15:30,381 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434364411] [2021-01-06 10:15:30,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201855979] [2021-01-06 10:15:30,382 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-06 10:15:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:30,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 10:15:30,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:15:30,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:30,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 10:15:30,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305126855] [2021-01-06 10:15:30,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 10:15:30,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:30,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 10:15:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:30,586 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand 5 states. [2021-01-06 10:15:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:30,624 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2021-01-06 10:15:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:15:30,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2021-01-06 10:15:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:30,626 INFO L225 Difference]: With dead ends: 60 [2021-01-06 10:15:30,627 INFO L226 Difference]: Without dead ends: 34 [2021-01-06 10:15:30,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-01-06 10:15:30,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2021-01-06 10:15:30,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2021-01-06 10:15:30,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2021-01-06 10:15:30,645 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 30 [2021-01-06 10:15:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:30,646 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2021-01-06 10:15:30,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 10:15:30,646 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2021-01-06 10:15:30,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-01-06 10:15:30,648 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:30,648 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] [2021-01-06 10:15:30,862 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:30,863 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:30,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash -861329106, now seen corresponding path program 2 times [2021-01-06 10:15:30,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:30,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031624315] [2021-01-06 10:15:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 10:15:30,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031624315] [2021-01-06 10:15:30,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142907328] [2021-01-06 10:15:30,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-06 10:15:31,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:15:31,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:31,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:15:31,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 10:15:31,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:31,073 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2021-01-06 10:15:31,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012572202] [2021-01-06 10:15:31,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-01-06 10:15:31,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:31,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-01-06 10:15:31,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:15:31,075 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 7 states. [2021-01-06 10:15:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:31,144 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2021-01-06 10:15:31,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-01-06 10:15:31,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2021-01-06 10:15:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:31,145 INFO L225 Difference]: With dead ends: 77 [2021-01-06 10:15:31,145 INFO L226 Difference]: Without dead ends: 51 [2021-01-06 10:15:31,146 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-01-06 10:15:31,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2021-01-06 10:15:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 44. [2021-01-06 10:15:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2021-01-06 10:15:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2021-01-06 10:15:31,152 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 32 [2021-01-06 10:15:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:31,153 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2021-01-06 10:15:31,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-01-06 10:15:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2021-01-06 10:15:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-01-06 10:15:31,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:31,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:31,368 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:31,369 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:31,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1600422655, now seen corresponding path program 3 times [2021-01-06 10:15:31,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:31,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347128515] [2021-01-06 10:15:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 10:15:31,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347128515] [2021-01-06 10:15:31,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179976269] [2021-01-06 10:15:31,456 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-06 10:15:31,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-01-06 10:15:31,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:31,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2021-01-06 10:15:31,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-01-06 10:15:31,565 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:31,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-01-06 10:15:31,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668247138] [2021-01-06 10:15:31,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 10:15:31,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:31,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 10:15:31,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:31,568 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 5 states. [2021-01-06 10:15:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:31,583 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2021-01-06 10:15:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 10:15:31,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2021-01-06 10:15:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:31,585 INFO L225 Difference]: With dead ends: 60 [2021-01-06 10:15:31,585 INFO L226 Difference]: Without dead ends: 47 [2021-01-06 10:15:31,585 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-01-06 10:15:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-01-06 10:15:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2021-01-06 10:15:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-01-06 10:15:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2021-01-06 10:15:31,590 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 43 [2021-01-06 10:15:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:31,591 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2021-01-06 10:15:31,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 10:15:31,591 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2021-01-06 10:15:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-01-06 10:15:31,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:31,593 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:31,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-01-06 10:15:31,807 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:31,808 INFO L82 PathProgramCache]: Analyzing trace with hash 477657599, now seen corresponding path program 4 times [2021-01-06 10:15:31,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:31,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764641154] [2021-01-06 10:15:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-01-06 10:15:31,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764641154] [2021-01-06 10:15:31,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123372191] [2021-01-06 10:15:31,889 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-06 10:15:31,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 10:15:31,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:31,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:15:31,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-01-06 10:15:32,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:32,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2021-01-06 10:15:32,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233112133] [2021-01-06 10:15:32,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-01-06 10:15:32,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:32,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-01-06 10:15:32,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:15:32,044 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 9 states. [2021-01-06 10:15:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:32,130 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2021-01-06 10:15:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 10:15:32,131 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2021-01-06 10:15:32,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:32,132 INFO L225 Difference]: With dead ends: 101 [2021-01-06 10:15:32,132 INFO L226 Difference]: Without dead ends: 64 [2021-01-06 10:15:32,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-01-06 10:15:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-01-06 10:15:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2021-01-06 10:15:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2021-01-06 10:15:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2021-01-06 10:15:32,139 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 45 [2021-01-06 10:15:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:32,139 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2021-01-06 10:15:32,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-01-06 10:15:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2021-01-06 10:15:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-01-06 10:15:32,141 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:32,141 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:32,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:32,355 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:32,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2141553364, now seen corresponding path program 5 times [2021-01-06 10:15:32,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:32,358 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15292513] [2021-01-06 10:15:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 10:15:32,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15292513] [2021-01-06 10:15:32,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903152195] [2021-01-06 10:15:32,523 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-06 10:15:32,678 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2021-01-06 10:15:32,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:32,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 10:15:32,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:32,764 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2021-01-06 10:15:32,764 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:32,764 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-01-06 10:15:32,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896948609] [2021-01-06 10:15:32,765 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:15:32,765 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:32,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:15:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:32,766 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand 11 states. [2021-01-06 10:15:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:32,853 INFO L93 Difference]: Finished difference Result 121 states and 156 transitions. [2021-01-06 10:15:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 10:15:32,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2021-01-06 10:15:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:32,854 INFO L225 Difference]: With dead ends: 121 [2021-01-06 10:15:32,855 INFO L226 Difference]: Without dead ends: 75 [2021-01-06 10:15:32,855 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-06 10:15:32,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2021-01-06 10:15:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2021-01-06 10:15:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2021-01-06 10:15:32,863 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 56 [2021-01-06 10:15:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:32,863 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2021-01-06 10:15:32,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:15:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2021-01-06 10:15:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-01-06 10:15:32,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:32,864 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:33,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:33,078 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:33,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1510106789, now seen corresponding path program 6 times [2021-01-06 10:15:33,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:33,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318018158] [2021-01-06 10:15:33,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2021-01-06 10:15:33,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318018158] [2021-01-06 10:15:33,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183321044] [2021-01-06 10:15:33,189 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-06 10:15:33,313 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2021-01-06 10:15:33,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:33,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjunts are in the unsatisfiable core [2021-01-06 10:15:33,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-01-06 10:15:33,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:33,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2021-01-06 10:15:33,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314474540] [2021-01-06 10:15:33,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:15:33,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:33,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:15:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:33,431 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 11 states. [2021-01-06 10:15:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:33,487 INFO L93 Difference]: Finished difference Result 129 states and 162 transitions. [2021-01-06 10:15:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 10:15:33,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2021-01-06 10:15:33,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:33,489 INFO L225 Difference]: With dead ends: 129 [2021-01-06 10:15:33,489 INFO L226 Difference]: Without dead ends: 74 [2021-01-06 10:15:33,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:33,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-01-06 10:15:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2021-01-06 10:15:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2021-01-06 10:15:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2021-01-06 10:15:33,497 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 67 [2021-01-06 10:15:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:33,497 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2021-01-06 10:15:33,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:15:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2021-01-06 10:15:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-01-06 10:15:33,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:33,499 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:33,712 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-01-06 10:15:33,713 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:33,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1769692567, now seen corresponding path program 7 times [2021-01-06 10:15:33,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:33,715 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910824994] [2021-01-06 10:15:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 10:15:33,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910824994] [2021-01-06 10:15:33,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408987049] [2021-01-06 10:15:33,893 INFO L93 rtionOrderModulation]: Changing assertion order to 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-06 10:15:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:33,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 10:15:33,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:34,079 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 10:15:34,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:34,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-01-06 10:15:34,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335404634] [2021-01-06 10:15:34,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 10:15:34,081 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 10:15:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:34,081 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 10 states. [2021-01-06 10:15:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:34,122 INFO L93 Difference]: Finished difference Result 132 states and 164 transitions. [2021-01-06 10:15:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 10:15:34,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2021-01-06 10:15:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:34,124 INFO L225 Difference]: With dead ends: 132 [2021-01-06 10:15:34,124 INFO L226 Difference]: Without dead ends: 75 [2021-01-06 10:15:34,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:34,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2021-01-06 10:15:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2021-01-06 10:15:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-01-06 10:15:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2021-01-06 10:15:34,135 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 71 [2021-01-06 10:15:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:34,135 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2021-01-06 10:15:34,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 10:15:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2021-01-06 10:15:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-01-06 10:15:34,138 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:34,138 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:34,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:34,353 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:34,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:34,354 INFO L82 PathProgramCache]: Analyzing trace with hash 514839125, now seen corresponding path program 8 times [2021-01-06 10:15:34,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:34,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217925859] [2021-01-06 10:15:34,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:34,506 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 10:15:34,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217925859] [2021-01-06 10:15:34,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605780223] [2021-01-06 10:15:34,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-06 10:15:34,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:15:34,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:34,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-06 10:15:34,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 10:15:34,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:34,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-01-06 10:15:34,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981982604] [2021-01-06 10:15:34,705 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:15:34,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:34,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:15:34,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:34,706 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 11 states. [2021-01-06 10:15:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:34,743 INFO L93 Difference]: Finished difference Result 134 states and 166 transitions. [2021-01-06 10:15:34,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:15:34,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 73 [2021-01-06 10:15:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:34,744 INFO L225 Difference]: With dead ends: 134 [2021-01-06 10:15:34,744 INFO L226 Difference]: Without dead ends: 77 [2021-01-06 10:15:34,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2021-01-06 10:15:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2021-01-06 10:15:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2021-01-06 10:15:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 92 transitions. [2021-01-06 10:15:34,751 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 92 transitions. Word has length 73 [2021-01-06 10:15:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:34,752 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 92 transitions. [2021-01-06 10:15:34,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:15:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 92 transitions. [2021-01-06 10:15:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-01-06 10:15:34,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:34,753 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:34,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:34,967 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:34,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1486491539, now seen corresponding path program 9 times [2021-01-06 10:15:34,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:34,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499021153] [2021-01-06 10:15:34,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-01-06 10:15:35,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499021153] [2021-01-06 10:15:35,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353988156] [2021-01-06 10:15:35,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-06 10:15:35,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-01-06 10:15:35,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:35,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2021-01-06 10:15:35,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:35,437 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-01-06 10:15:35,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:35,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2021-01-06 10:15:35,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238251722] [2021-01-06 10:15:35,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-01-06 10:15:35,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:35,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-01-06 10:15:35,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-01-06 10:15:35,439 INFO L87 Difference]: Start difference. First operand 76 states and 92 transitions. Second operand 15 states. [2021-01-06 10:15:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:35,508 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2021-01-06 10:15:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-01-06 10:15:35,508 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2021-01-06 10:15:35,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:35,509 INFO L225 Difference]: With dead ends: 139 [2021-01-06 10:15:35,509 INFO L226 Difference]: Without dead ends: 82 [2021-01-06 10:15:35,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2021-01-06 10:15:35,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2021-01-06 10:15:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2021-01-06 10:15:35,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2021-01-06 10:15:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2021-01-06 10:15:35,515 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 75 [2021-01-06 10:15:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:35,515 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2021-01-06 10:15:35,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-01-06 10:15:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2021-01-06 10:15:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-01-06 10:15:35,517 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:35,517 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:35,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-01-06 10:15:35,731 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 907675599, now seen corresponding path program 10 times [2021-01-06 10:15:35,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:35,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398200634] [2021-01-06 10:15:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-01-06 10:15:35,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398200634] [2021-01-06 10:15:35,877 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433449361] [2021-01-06 10:15:35,878 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-06 10:15:35,976 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 10:15:35,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:35,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:15:35,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2021-01-06 10:15:36,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:36,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2021-01-06 10:15:36,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987991746] [2021-01-06 10:15:36,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-01-06 10:15:36,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:36,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-01-06 10:15:36,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-01-06 10:15:36,144 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 17 states. [2021-01-06 10:15:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:36,306 INFO L93 Difference]: Finished difference Result 156 states and 197 transitions. [2021-01-06 10:15:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-01-06 10:15:36,307 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2021-01-06 10:15:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:36,308 INFO L225 Difference]: With dead ends: 156 [2021-01-06 10:15:36,308 INFO L226 Difference]: Without dead ends: 97 [2021-01-06 10:15:36,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2021-01-06 10:15:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-01-06 10:15:36,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2021-01-06 10:15:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2021-01-06 10:15:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2021-01-06 10:15:36,313 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 79 [2021-01-06 10:15:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:36,314 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2021-01-06 10:15:36,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2021-01-06 10:15:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2021-01-06 10:15:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 10:15:36,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:36,315 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:36,528 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-01-06 10:15:36,529 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:36,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash -552979580, now seen corresponding path program 11 times [2021-01-06 10:15:36,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:36,531 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502866922] [2021-01-06 10:15:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-01-06 10:15:36,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502866922] [2021-01-06 10:15:36,621 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290558193] [2021-01-06 10:15:36,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:36,999 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-01-06 10:15:36,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:37,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjunts are in the unsatisfiable core [2021-01-06 10:15:37,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:37,141 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2021-01-06 10:15:37,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:37,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-01-06 10:15:37,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92096095] [2021-01-06 10:15:37,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-01-06 10:15:37,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:37,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-01-06 10:15:37,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-01-06 10:15:37,143 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 13 states. [2021-01-06 10:15:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:37,261 INFO L93 Difference]: Finished difference Result 160 states and 201 transitions. [2021-01-06 10:15:37,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-01-06 10:15:37,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2021-01-06 10:15:37,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:37,262 INFO L225 Difference]: With dead ends: 160 [2021-01-06 10:15:37,262 INFO L226 Difference]: Without dead ends: 109 [2021-01-06 10:15:37,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-01-06 10:15:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-01-06 10:15:37,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 102. [2021-01-06 10:15:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2021-01-06 10:15:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2021-01-06 10:15:37,284 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 90 [2021-01-06 10:15:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:37,285 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2021-01-06 10:15:37,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2021-01-06 10:15:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2021-01-06 10:15:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 10:15:37,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:37,286 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:37,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-01-06 10:15:37,500 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:37,501 INFO L82 PathProgramCache]: Analyzing trace with hash 162928491, now seen corresponding path program 12 times [2021-01-06 10:15:37,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:37,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393530976] [2021-01-06 10:15:37,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2021-01-06 10:15:37,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393530976] [2021-01-06 10:15:37,617 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789088700] [2021-01-06 10:15:37,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:38,246 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-01-06 10:15:38,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:38,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 10:15:38,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2021-01-06 10:15:38,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:38,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-01-06 10:15:38,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642109341] [2021-01-06 10:15:38,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 10:15:38,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 10:15:38,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:38,367 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand 10 states. [2021-01-06 10:15:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:38,455 INFO L93 Difference]: Finished difference Result 176 states and 221 transitions. [2021-01-06 10:15:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 10:15:38,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 101 [2021-01-06 10:15:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:38,457 INFO L225 Difference]: With dead ends: 176 [2021-01-06 10:15:38,457 INFO L226 Difference]: Without dead ends: 117 [2021-01-06 10:15:38,458 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-01-06 10:15:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2021-01-06 10:15:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2021-01-06 10:15:38,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions. [2021-01-06 10:15:38,463 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 101 [2021-01-06 10:15:38,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:38,463 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 136 transitions. [2021-01-06 10:15:38,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 10:15:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions. [2021-01-06 10:15:38,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-01-06 10:15:38,464 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:38,464 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:38,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:38,680 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:38,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:38,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1248251046, now seen corresponding path program 13 times [2021-01-06 10:15:38,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:38,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386557742] [2021-01-06 10:15:38,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:38,806 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2021-01-06 10:15:38,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386557742] [2021-01-06 10:15:38,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316799505] [2021-01-06 10:15:38,807 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:38,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-06 10:15:38,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 335 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2021-01-06 10:15:39,043 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:39,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-01-06 10:15:39,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331600908] [2021-01-06 10:15:39,044 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:15:39,044 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:39,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:15:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:39,045 INFO L87 Difference]: Start difference. First operand 111 states and 136 transitions. Second operand 11 states. [2021-01-06 10:15:39,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:39,145 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2021-01-06 10:15:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:15:39,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2021-01-06 10:15:39,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:39,147 INFO L225 Difference]: With dead ends: 191 [2021-01-06 10:15:39,147 INFO L226 Difference]: Without dead ends: 126 [2021-01-06 10:15:39,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:39,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-01-06 10:15:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2021-01-06 10:15:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2021-01-06 10:15:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 148 transitions. [2021-01-06 10:15:39,153 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 148 transitions. Word has length 110 [2021-01-06 10:15:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:39,154 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 148 transitions. [2021-01-06 10:15:39,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:15:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2021-01-06 10:15:39,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-01-06 10:15:39,155 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:39,155 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:39,369 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-01-06 10:15:39,369 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash 166356171, now seen corresponding path program 14 times [2021-01-06 10:15:39,371 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:39,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832843960] [2021-01-06 10:15:39,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2021-01-06 10:15:39,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832843960] [2021-01-06 10:15:39,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465460486] [2021-01-06 10:15:39,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:39,648 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:15:39,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:39,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 10:15:39,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2021-01-06 10:15:39,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:39,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-01-06 10:15:39,755 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823719624] [2021-01-06 10:15:39,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 10:15:39,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:39,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 10:15:39,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:15:39,756 INFO L87 Difference]: Start difference. First operand 120 states and 148 transitions. Second operand 12 states. [2021-01-06 10:15:39,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:39,936 INFO L93 Difference]: Finished difference Result 206 states and 261 transitions. [2021-01-06 10:15:39,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 10:15:39,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2021-01-06 10:15:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:39,939 INFO L225 Difference]: With dead ends: 206 [2021-01-06 10:15:39,939 INFO L226 Difference]: Without dead ends: 135 [2021-01-06 10:15:39,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:15:39,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-01-06 10:15:39,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 129. [2021-01-06 10:15:39,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2021-01-06 10:15:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 160 transitions. [2021-01-06 10:15:39,947 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 160 transitions. Word has length 119 [2021-01-06 10:15:39,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:39,947 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 160 transitions. [2021-01-06 10:15:39,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 10:15:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 160 transitions. [2021-01-06 10:15:39,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-01-06 10:15:39,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:39,948 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:40,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-01-06 10:15:40,163 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:40,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:40,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1709607226, now seen corresponding path program 15 times [2021-01-06 10:15:40,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:40,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178649398] [2021-01-06 10:15:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 359 trivial. 0 not checked. [2021-01-06 10:15:40,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178649398] [2021-01-06 10:15:40,317 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580963951] [2021-01-06 10:15:40,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:40,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-01-06 10:15:40,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:40,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 7 conjunts are in the unsatisfiable core [2021-01-06 10:15:40,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2021-01-06 10:15:40,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:40,873 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2021-01-06 10:15:40,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890340272] [2021-01-06 10:15:40,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2021-01-06 10:15:40,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:40,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-01-06 10:15:40,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-01-06 10:15:40,875 INFO L87 Difference]: Start difference. First operand 129 states and 160 transitions. Second operand 18 states. [2021-01-06 10:15:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:41,074 INFO L93 Difference]: Finished difference Result 218 states and 276 transitions. [2021-01-06 10:15:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-01-06 10:15:41,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 128 [2021-01-06 10:15:41,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:41,077 INFO L225 Difference]: With dead ends: 218 [2021-01-06 10:15:41,077 INFO L226 Difference]: Without dead ends: 141 [2021-01-06 10:15:41,077 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2021-01-06 10:15:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-01-06 10:15:41,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2021-01-06 10:15:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2021-01-06 10:15:41,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2021-01-06 10:15:41,086 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 128 [2021-01-06 10:15:41,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:41,087 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2021-01-06 10:15:41,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2021-01-06 10:15:41,087 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2021-01-06 10:15:41,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-01-06 10:15:41,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:41,090 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:41,304 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:41,305 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1504295593, now seen corresponding path program 16 times [2021-01-06 10:15:41,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:41,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625927262] [2021-01-06 10:15:41,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2021-01-06 10:15:41,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625927262] [2021-01-06 10:15:41,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522027024] [2021-01-06 10:15:41,461 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:41,625 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-01-06 10:15:41,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:41,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 8 conjunts are in the unsatisfiable core [2021-01-06 10:15:41,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:41,749 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2021-01-06 10:15:41,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:41,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2021-01-06 10:15:41,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260456673] [2021-01-06 10:15:41,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-01-06 10:15:41,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:41,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-01-06 10:15:41,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:41,751 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 10 states. [2021-01-06 10:15:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:41,787 INFO L93 Difference]: Finished difference Result 180 states and 225 transitions. [2021-01-06 10:15:41,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-01-06 10:15:41,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 139 [2021-01-06 10:15:41,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:41,789 INFO L225 Difference]: With dead ends: 180 [2021-01-06 10:15:41,789 INFO L226 Difference]: Without dead ends: 143 [2021-01-06 10:15:41,790 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2021-01-06 10:15:41,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-01-06 10:15:41,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-01-06 10:15:41,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-01-06 10:15:41,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2021-01-06 10:15:41,795 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 139 [2021-01-06 10:15:41,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:41,796 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2021-01-06 10:15:41,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-01-06 10:15:41,796 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2021-01-06 10:15:41,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-01-06 10:15:41,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:41,797 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:42,010 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:42,010 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1789996121, now seen corresponding path program 17 times [2021-01-06 10:15:42,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:42,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011271958] [2021-01-06 10:15:42,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2021-01-06 10:15:42,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011271958] [2021-01-06 10:15:42,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795011463] [2021-01-06 10:15:42,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:42,969 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-01-06 10:15:42,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:42,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 9 conjunts are in the unsatisfiable core [2021-01-06 10:15:42,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2021-01-06 10:15:43,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:43,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2021-01-06 10:15:43,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525480663] [2021-01-06 10:15:43,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-01-06 10:15:43,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:43,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-01-06 10:15:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:43,112 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand 11 states. [2021-01-06 10:15:43,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:43,144 INFO L93 Difference]: Finished difference Result 182 states and 227 transitions. [2021-01-06 10:15:43,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-01-06 10:15:43,145 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2021-01-06 10:15:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:43,146 INFO L225 Difference]: With dead ends: 182 [2021-01-06 10:15:43,146 INFO L226 Difference]: Without dead ends: 145 [2021-01-06 10:15:43,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-01-06 10:15:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-01-06 10:15:43,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2021-01-06 10:15:43,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-01-06 10:15:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2021-01-06 10:15:43,152 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 141 [2021-01-06 10:15:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:43,152 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2021-01-06 10:15:43,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-01-06 10:15:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2021-01-06 10:15:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2021-01-06 10:15:43,153 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:43,153 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:43,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:43,368 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:43,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2081531173, now seen corresponding path program 18 times [2021-01-06 10:15:43,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:43,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169726070] [2021-01-06 10:15:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2021-01-06 10:15:43,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169726070] [2021-01-06 10:15:43,511 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535340960] [2021-01-06 10:15:43,512 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:44,552 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2021-01-06 10:15:44,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:15:44,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 10 conjunts are in the unsatisfiable core [2021-01-06 10:15:44,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2021-01-06 10:15:44,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:44,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2021-01-06 10:15:44,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157439242] [2021-01-06 10:15:44,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-01-06 10:15:44,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:44,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-01-06 10:15:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:15:44,717 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand 12 states. [2021-01-06 10:15:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:44,756 INFO L93 Difference]: Finished difference Result 183 states and 228 transitions. [2021-01-06 10:15:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-01-06 10:15:44,759 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 143 [2021-01-06 10:15:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:44,760 INFO L225 Difference]: With dead ends: 183 [2021-01-06 10:15:44,761 INFO L226 Difference]: Without dead ends: 146 [2021-01-06 10:15:44,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-01-06 10:15:44,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-01-06 10:15:44,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-01-06 10:15:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-01-06 10:15:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2021-01-06 10:15:44,768 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 143 [2021-01-06 10:15:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:44,768 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2021-01-06 10:15:44,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-01-06 10:15:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2021-01-06 10:15:44,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 10:15:44,769 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:44,769 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:44,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-01-06 10:15:44,985 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1117384925, now seen corresponding path program 19 times [2021-01-06 10:15:44,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:44,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161193621] [2021-01-06 10:15:44,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:45,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-01-06 10:15:47,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161193621] [2021-01-06 10:15:47,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66549069] [2021-01-06 10:15:47,133 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:47,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:47,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 79 conjunts are in the unsatisfiable core [2021-01-06 10:15:47,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:47,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:15:47,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:15:48,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:15:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2021-01-06 10:15:48,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:48,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 45 [2021-01-06 10:15:48,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678679742] [2021-01-06 10:15:48,451 INFO L461 AbstractCegarLoop]: Interpolant automaton has 45 states [2021-01-06 10:15:48,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:48,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-01-06 10:15:48,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1832, Unknown=0, NotChecked=0, Total=1980 [2021-01-06 10:15:48,453 INFO L87 Difference]: Start difference. First operand 146 states and 180 transitions. Second operand 45 states. [2021-01-06 10:15:51,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:15:51,069 INFO L93 Difference]: Finished difference Result 1547 states and 1858 transitions. [2021-01-06 10:15:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-01-06 10:15:51,070 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 145 [2021-01-06 10:15:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:15:51,079 INFO L225 Difference]: With dead ends: 1547 [2021-01-06 10:15:51,079 INFO L226 Difference]: Without dead ends: 1542 [2021-01-06 10:15:51,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=195, Invalid=2157, Unknown=0, NotChecked=0, Total=2352 [2021-01-06 10:15:51,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2021-01-06 10:15:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 519. [2021-01-06 10:15:51,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 519 states. [2021-01-06 10:15:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 693 transitions. [2021-01-06 10:15:51,121 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 693 transitions. Word has length 145 [2021-01-06 10:15:51,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:15:51,122 INFO L481 AbstractCegarLoop]: Abstraction has 519 states and 693 transitions. [2021-01-06 10:15:51,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2021-01-06 10:15:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 693 transitions. [2021-01-06 10:15:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 10:15:51,124 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:15:51,124 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:15:51,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-01-06 10:15:51,338 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:15:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:15:51,339 INFO L82 PathProgramCache]: Analyzing trace with hash 657622437, now seen corresponding path program 1 times [2021-01-06 10:15:51,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:15:51,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654921281] [2021-01-06 10:15:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:15:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 19 proven. 301 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2021-01-06 10:15:53,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654921281] [2021-01-06 10:15:53,449 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658907128] [2021-01-06 10:15:53,449 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:15:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:15:53,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 53 conjunts are in the unsatisfiable core [2021-01-06 10:15:53,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:15:53,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:15:53,717 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 22 treesize of output 17 [2021-01-06 10:15:53,718 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:15:53,730 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:15:53,732 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-06 10:15:53,732 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:13 [2021-01-06 10:15:53,869 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-01-06 10:15:53,871 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:15:53,875 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:15:53,876 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:15:53,876 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2021-01-06 10:15:53,910 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 15 treesize of output 11 [2021-01-06 10:15:53,911 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:15:53,921 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:15:53,923 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-06 10:15:53,924 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:23 [2021-01-06 10:15:54,486 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2021-01-06 10:15:54,488 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:15:54,489 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:15:54,490 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-06 10:15:54,490 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:7 [2021-01-06 10:15:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 19 proven. 145 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2021-01-06 10:15:54,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:15:54,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 18] total 42 [2021-01-06 10:15:54,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985231537] [2021-01-06 10:15:54,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 42 states [2021-01-06 10:15:54,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:15:54,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2021-01-06 10:15:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1608, Unknown=0, NotChecked=0, Total=1722 [2021-01-06 10:15:54,567 INFO L87 Difference]: Start difference. First operand 519 states and 693 transitions. Second operand 42 states. [2021-01-06 10:16:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:16:00,986 INFO L93 Difference]: Finished difference Result 1513 states and 2014 transitions. [2021-01-06 10:16:00,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2021-01-06 10:16:00,987 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 145 [2021-01-06 10:16:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:16:00,993 INFO L225 Difference]: With dead ends: 1513 [2021-01-06 10:16:00,993 INFO L226 Difference]: Without dead ends: 1198 [2021-01-06 10:16:00,998 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2826 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=803, Invalid=10327, Unknown=0, NotChecked=0, Total=11130 [2021-01-06 10:16:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2021-01-06 10:16:01,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 775. [2021-01-06 10:16:01,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2021-01-06 10:16:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1028 transitions. [2021-01-06 10:16:01,059 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1028 transitions. Word has length 145 [2021-01-06 10:16:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:16:01,059 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 1028 transitions. [2021-01-06 10:16:01,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2021-01-06 10:16:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1028 transitions. [2021-01-06 10:16:01,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 10:16:01,062 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:16:01,062 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:16:01,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:01,275 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:16:01,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:16:01,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1510411935, now seen corresponding path program 2 times [2021-01-06 10:16:01,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:16:01,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305196792] [2021-01-06 10:16:01,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:16:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:07,562 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 43 proven. 487 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-01-06 10:16:07,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305196792] [2021-01-06 10:16:07,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258220630] [2021-01-06 10:16:07,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:07,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-01-06 10:16:07,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:16:07,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 110 conjunts are in the unsatisfiable core [2021-01-06 10:16:07,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:16:09,564 INFO L348 Elim1Store]: treesize reduction 86, result has 16.5 percent of original size [2021-01-06 10:16:09,565 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 31 [2021-01-06 10:16:09,567 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:09,573 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:09,575 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-06 10:16:09,575 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:11 [2021-01-06 10:16:09,774 INFO L348 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2021-01-06 10:16:09,774 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 68 [2021-01-06 10:16:09,779 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:09,803 INFO L625 ElimStorePlain]: treesize reduction 31, result has 53.0 percent of original size [2021-01-06 10:16:09,803 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:09,804 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2021-01-06 10:16:10,181 INFO L348 Elim1Store]: treesize reduction 160, result has 32.8 percent of original size [2021-01-06 10:16:10,182 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 97 [2021-01-06 10:16:10,186 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:10,188 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:10,214 INFO L625 ElimStorePlain]: treesize reduction 80, result has 30.4 percent of original size [2021-01-06 10:16:10,215 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:10,215 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:35 [2021-01-06 10:16:10,603 INFO L348 Elim1Store]: treesize reduction 160, result has 32.8 percent of original size [2021-01-06 10:16:10,604 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 97 [2021-01-06 10:16:10,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:10,611 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:10,638 INFO L625 ElimStorePlain]: treesize reduction 76, result has 31.5 percent of original size [2021-01-06 10:16:10,639 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:10,639 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:35 [2021-01-06 10:16:11,060 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2021-01-06 10:16:11,061 INFO L348 Elim1Store]: treesize reduction 120, result has 52.0 percent of original size [2021-01-06 10:16:11,062 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 149 [2021-01-06 10:16:11,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:11,066 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:11,070 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:11,102 INFO L625 ElimStorePlain]: treesize reduction 109, result has 23.2 percent of original size [2021-01-06 10:16:11,103 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:11,104 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:33 [2021-01-06 10:16:11,536 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2021-01-06 10:16:11,537 INFO L348 Elim1Store]: treesize reduction 120, result has 52.0 percent of original size [2021-01-06 10:16:11,537 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 149 [2021-01-06 10:16:11,541 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:11,542 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:11,544 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:11,584 INFO L625 ElimStorePlain]: treesize reduction 109, result has 23.2 percent of original size [2021-01-06 10:16:11,585 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:11,585 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:33 [2021-01-06 10:16:12,028 WARN L197 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2021-01-06 10:16:12,029 INFO L348 Elim1Store]: treesize reduction 98, result has 54.8 percent of original size [2021-01-06 10:16:12,030 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 53 treesize of output 138 [2021-01-06 10:16:12,036 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:12,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:12,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:12,048 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:12,075 INFO L625 ElimStorePlain]: treesize reduction 95, result has 26.9 percent of original size [2021-01-06 10:16:12,076 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:12,076 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:35 [2021-01-06 10:16:12,476 INFO L348 Elim1Store]: treesize reduction 160, result has 32.8 percent of original size [2021-01-06 10:16:12,476 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 97 [2021-01-06 10:16:12,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:12,484 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:12,509 INFO L625 ElimStorePlain]: treesize reduction 80, result has 30.4 percent of original size [2021-01-06 10:16:12,510 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:12,510 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:35 [2021-01-06 10:16:12,996 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2021-01-06 10:16:12,997 INFO L348 Elim1Store]: treesize reduction 120, result has 52.0 percent of original size [2021-01-06 10:16:13,001 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 51 treesize of output 149 [2021-01-06 10:16:13,005 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:13,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:13,007 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,042 INFO L625 ElimStorePlain]: treesize reduction 109, result has 23.2 percent of original size [2021-01-06 10:16:13,043 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,043 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:33 [2021-01-06 10:16:13,424 INFO L348 Elim1Store]: treesize reduction 88, result has 17.8 percent of original size [2021-01-06 10:16:13,425 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 36 [2021-01-06 10:16:13,427 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:13,433 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,433 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:27 [2021-01-06 10:16:13,637 INFO L348 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2021-01-06 10:16:13,638 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 27 [2021-01-06 10:16:13,641 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:13,649 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:13,651 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-06 10:16:13,651 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:15 [2021-01-06 10:16:15,086 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-06 10:16:15,087 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:15,090 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:15,090 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-06 10:16:15,091 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2021-01-06 10:16:15,312 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 43 proven. 425 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2021-01-06 10:16:15,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-01-06 10:16:15,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 51] total 105 [2021-01-06 10:16:15,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115237361] [2021-01-06 10:16:15,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 105 states [2021-01-06 10:16:15,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 10:16:15,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2021-01-06 10:16:15,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=10602, Unknown=0, NotChecked=0, Total=10920 [2021-01-06 10:16:15,317 INFO L87 Difference]: Start difference. First operand 775 states and 1028 transitions. Second operand 105 states. [2021-01-06 10:16:31,719 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 26 [2021-01-06 10:16:33,358 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 29 [2021-01-06 10:16:34,119 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 30 [2021-01-06 10:16:34,563 WARN L197 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 35 [2021-01-06 10:16:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 10:16:35,494 INFO L93 Difference]: Finished difference Result 1698 states and 2263 transitions. [2021-01-06 10:16:35,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-01-06 10:16:35,495 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 145 [2021-01-06 10:16:35,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 10:16:35,504 INFO L225 Difference]: With dead ends: 1698 [2021-01-06 10:16:35,504 INFO L226 Difference]: Without dead ends: 1406 [2021-01-06 10:16:35,511 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 98 SyntacticMatches, 11 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5409 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=956, Invalid=24166, Unknown=0, NotChecked=0, Total=25122 [2021-01-06 10:16:35,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2021-01-06 10:16:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1272. [2021-01-06 10:16:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1272 states. [2021-01-06 10:16:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1700 transitions. [2021-01-06 10:16:35,607 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1700 transitions. Word has length 145 [2021-01-06 10:16:35,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 10:16:35,608 INFO L481 AbstractCegarLoop]: Abstraction has 1272 states and 1700 transitions. [2021-01-06 10:16:35,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2021-01-06 10:16:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1700 transitions. [2021-01-06 10:16:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-01-06 10:16:35,611 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 10:16:35,611 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 10:16:35,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-01-06 10:16:35,827 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 10:16:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 10:16:35,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1704190939, now seen corresponding path program 3 times [2021-01-06 10:16:35,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 10:16:35,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973245016] [2021-01-06 10:16:35,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 10:16:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 10:16:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 61 proven. 547 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 10:16:40,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973245016] [2021-01-06 10:16:40,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082790231] [2021-01-06 10:16:40,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-01-06 10:16:41,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-01-06 10:16:41,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-01-06 10:16:41,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 84 conjunts are in the unsatisfiable core [2021-01-06 10:16:41,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-01-06 10:16:42,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:42,158 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 22 treesize of output 17 [2021-01-06 10:16:42,160 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:42,167 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:42,169 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-06 10:16:42,169 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:7 [2021-01-06 10:16:44,090 INFO L348 Elim1Store]: treesize reduction 57, result has 52.9 percent of original size [2021-01-06 10:16:44,090 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 80 [2021-01-06 10:16:44,094 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:44,138 INFO L625 ElimStorePlain]: treesize reduction 42, result has 51.2 percent of original size [2021-01-06 10:16:44,140 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-06 10:16:44,140 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2021-01-06 10:16:44,806 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 10:16:44,807 INFO L348 Elim1Store]: treesize reduction 109, result has 64.4 percent of original size [2021-01-06 10:16:44,808 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 216 [2021-01-06 10:16:44,812 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:44,813 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:44,813 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:44,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:44,814 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:44,814 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:44,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:44,817 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:44,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:44,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:44,825 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:45,003 WARN L197 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2021-01-06 10:16:45,004 INFO L625 ElimStorePlain]: treesize reduction 379, result has 20.0 percent of original size [2021-01-06 10:16:45,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:45,012 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 10:16:45,012 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:95 [2021-01-06 10:16:45,015 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,017 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:45,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:45,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:16:45,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:45,813 WARN L197 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 10:16:45,814 INFO L348 Elim1Store]: treesize reduction 109, result has 64.4 percent of original size [2021-01-06 10:16:45,814 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 216 [2021-01-06 10:16:45,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:45,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:45,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:45,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:45,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:45,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:45,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:45,831 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:45,993 WARN L197 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 41 [2021-01-06 10:16:45,994 INFO L625 ElimStorePlain]: treesize reduction 434, result has 15.4 percent of original size [2021-01-06 10:16:45,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:45,997 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 10:16:45,997 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:79 [2021-01-06 10:16:45,999 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:46,228 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:46,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:46,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:52,695 WARN L197 SmtUtils]: Spent 6.07 s on a formula simplification that was a NOOP. DAG size: 54 [2021-01-06 10:16:52,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:52,867 INFO L244 Elim1Store]: Index analysis took 131 ms [2021-01-06 10:16:53,072 WARN L197 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-01-06 10:16:53,073 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:53,073 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 79 treesize of output 381 [2021-01-06 10:16:53,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:16:53,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:16:53,080 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:16:53,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:53,081 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:16:53,081 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,082 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,082 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,083 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:53,083 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:53,084 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:53,084 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:53,087 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 3, 2, 4, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:16:53,088 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:16:53,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:16:53,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:16:53,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:16:53,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:53,091 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:16:53,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,093 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,093 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:53,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:53,094 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:53,094 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:53,097 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:16:53,097 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,098 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:16:53,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:53,099 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:16:53,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,100 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,100 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:53,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:53,101 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:53,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:53,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:16:53,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:16:53,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:53,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:16:53,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 2, 1] term [2021-01-06 10:16:53,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:16:53,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:53,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:16:53,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,109 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,110 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:53,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:53,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:53,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:53,113 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,114 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,114 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:16:53,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:16:53,115 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:16:53,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:53,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:16:53,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:16:53,117 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,134 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:53,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:53,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:53,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:53,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:53,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:53,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:16:53,228 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:16:53,229 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 182 [2021-01-06 10:16:53,231 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:16:53,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:53,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:16:53,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:53,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:16:53,233 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:16:53,237 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:16:54,425 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 170 DAG size of output: 85 [2021-01-06 10:16:54,427 INFO L625 ElimStorePlain]: treesize reduction 1391, result has 17.2 percent of original size [2021-01-06 10:16:54,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:54,433 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 10:16:54,435 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 10:16:54,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:54,437 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 10:16:54,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:54,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:54,447 INFO L547 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2021-01-06 10:16:54,448 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:173, output treesize:288 [2021-01-06 10:16:54,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:54,452 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 10:16:54,454 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2021-01-06 10:16:54,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:54,456 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2021-01-06 10:16:54,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:54,462 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:16:54,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:16:54,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:16:54,853 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,292 WARN L197 SmtUtils]: Spent 6.08 s on a formula simplification that was a NOOP. DAG size: 56 [2021-01-06 10:17:13,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:17:13,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,459 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:17:13,462 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 182 [2021-01-06 10:17:13,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:17:13,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:13,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:17:13,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:13,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:17:13,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:17:13,475 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:17:13,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:17:13,738 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-01-06 10:17:13,738 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:17:13,739 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 80 treesize of output 388 [2021-01-06 10:17:13,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:17:13,745 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:17:13,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:17:13,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:13,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:17:13,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,747 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:17:13,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:13,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:17:13,748 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:13,749 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:17:13,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:17:13,756 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 5, 2, 2, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:17:13,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:17:13,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:17:13,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:17:13,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:13,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:17:13,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,759 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:17:13,759 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:13,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:17:13,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:13,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:17:13,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:17:13,763 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 2, 2, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:17:13,763 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:17:13,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,764 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 2, 2, 1] term [2021-01-06 10:17:13,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:17:13,765 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:13,766 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:17:13,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:17:13,767 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:13,767 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:17:13,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:13,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:17:13,768 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:17:13,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 2, 2, 1] term [2021-01-06 10:17:13,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,771 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:17:13,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:13,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:17:13,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:13,772 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:17:13,772 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:17:13,774 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:17:13,774 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:13,775 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:17:13,775 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:17:13,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:13,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:17:13,777 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:13,792 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:17:15,050 WARN L197 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 176 DAG size of output: 93 [2021-01-06 10:17:15,051 INFO L625 ElimStorePlain]: treesize reduction 1744, result has 14.8 percent of original size [2021-01-06 10:17:15,055 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,056 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,057 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,059 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,062 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,063 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,065 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:15,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:15,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:17:15,089 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,090 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,093 INFO L547 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2021-01-06 10:17:15,093 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:174, output treesize:302 [2021-01-06 10:17:15,098 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,099 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,101 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:17:15,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,109 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:17:15,115 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:17:15,117 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:17:15,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:17:15,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,843 WARN L197 SmtUtils]: Spent 16.16 s on a formula simplification that was a NOOP. DAG size: 112 [2021-01-06 10:18:10,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:18:10,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,870 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,874 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:18:10,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:18:10,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:18:10,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:18:10,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:00,004 WARN L197 SmtUtils]: Spent 22.14 s on a formula simplification. DAG size of input: 109 DAG size of output: 31 [2021-01-06 10:19:00,290 WARN L197 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2021-01-06 10:19:00,291 INFO L348 Elim1Store]: treesize reduction 109, result has 64.4 percent of original size [2021-01-06 10:19:00,291 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 216 [2021-01-06 10:19:00,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:19:00,296 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:00,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:19:00,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:00,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:19:00,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,306 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:19:00,541 WARN L197 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 42 [2021-01-06 10:19:00,547 INFO L625 ElimStorePlain]: treesize reduction 415, result has 20.3 percent of original size [2021-01-06 10:19:00,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,551 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:00,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:00,554 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,555 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-01-06 10:19:00,555 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:68, output treesize:106 [2021-01-06 10:19:00,557 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:00,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:00,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,823 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:00,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:00,825 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:00,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:19,169 WARN L197 SmtUtils]: Spent 18.11 s on a formula simplification that was a NOOP. DAG size: 45 [2021-01-06 10:19:19,177 INFO L639 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2021-01-06 10:19:19,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,259 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 65 [2021-01-06 10:19:19,263 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-01-06 10:19:19,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,380 INFO L244 Elim1Store]: Index analysis took 108 ms [2021-01-06 10:19:19,583 WARN L197 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-01-06 10:19:19,584 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-01-06 10:19:19,584 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 79 treesize of output 352 [2021-01-06 10:19:19,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 1] term [2021-01-06 10:19:19,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-01-06 10:19:19,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-01-06 10:19:19,590 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-01-06 10:19:19,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 1] term [2021-01-06 10:19:19,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-01-06 10:19:19,591 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 1] term [2021-01-06 10:19:19,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:19,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 1] term [2021-01-06 10:19:19,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:19,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2021-01-06 10:19:19,593 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:19,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-01-06 10:19:19,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:19,596 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-01-06 10:19:19,603 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-01-06 10:19:19,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-01-06 10:19:19,632 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 56 [2021-01-06 10:19:19,635 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-01-06 10:19:20,284 WARN L197 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 76 [2021-01-06 10:19:20,285 INFO L625 ElimStorePlain]: treesize reduction 531, result has 30.6 percent of original size [2021-01-06 10:19:20,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,293 INFO L547 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2021-01-06 10:19:20,293 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:231, output treesize:234 [2021-01-06 10:19:20,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,302 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:20,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:35,311 WARN L197 SmtUtils]: Spent 14.14 s on a formula simplification that was a NOOP. DAG size: 86 [2021-01-06 10:19:35,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:35,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:35,321 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-01-06 10:19:35,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts